×

zbMATH — the first resource for mathematics

Robust distributed multiplication without interaction. (English) Zbl 0940.94005
Wiener, Michael (ed.), Advances in cryptology - CRYPTO ’99. 19th annual international cryptology conference Santa Barbara, CA, USA, August 15-19, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1666, 130-147 (1999).
Summary: An optimally resilient distributed multiplication protocol that enjoys the property of non-interactivity is presented. The protocol relies on a standard cryptographic assumption and works over a complete, synchronous, untappable network with a broadcast channel. As long as no disruption occurs, each player uses those channels only once to send messages; thus no interaction is needed among players. The cost is an increase in local computation and communication complexity that is determined by the factor of the threshold.
As an application of the proposed protocol the author presents a robust threshold version of the Cramer-Shoup cryptosystem, which is the first non-interactive solution with optimal resiliency.
For the entire collection see [Zbl 0921.00042].

MSC:
94A60 Cryptography
PDF BibTeX XML Cite