Abstract
To obtain security, one needs to utilize many resources. Among these are one-way functions, physically secure communication channels, and —though less well known— broadcasting.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Ben-Or and R. El-Yaniv. Interactive consistency in constant expected time. Inst. of Math. and Comp. Sci., Hebrew University, Jerusalem, 1988.
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for fault-tolerant distributed computing. In Proc. 20th ACM Symposium on Theory of Computing, pages 1–10, Chicago, 1988. ACM.
D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In Proc. 22th ACM Symposium on Theory of Computing, May 1990.
G. Blakely. Safeguarding cryptographic keys. In AFIPS, volume 48, pages 313–317. NCC, June 1979.
S. Goldwasser B. Awerbuch, B. Chor and S. Micali. Verifiable secret sharing in the presence of faults. In Proc. of the 27th Annual IEEE Symposium on Foundations of Computer Science, 1986.
A.Z. Broder and D. Dolev. Flipping coins in many pockets (byzantine agreement on uniformly random values. In Proc. of the 25th Annual IEEE Symposium on Foundations of Computer Science, pages 157–170. IEEE Computer Society Press, October 1984.
D. Chaum, C. Crepeau, and I. Damgard. Multi-party unconditionally secure protocols. In Proc. 20th ACM Symposium on Theory of Computing, Chicago, 1988. ACM.
P. Feldman and S. Micali. An optimal algorithm for synchronous byzantine agreement. Technical Report LCS/TM-425, MIT, June 1990. (Submitted for publication in SIAM J. on Computing.).
Z. Galil, S. Haber, and M. Yung. Cryptographic computation: Secure falt-tolerant protocols and public-key model. In Proc. CRYPTO 87, pages 135–155. Springer Verlag, 1987.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proc. of the 27th Annual IEEE Symposium on Foundations of Computer Science, pages 174–187, Toronto, 1986. IEEE.
T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocoles with honest majority. In Proc. 21th ACM Symposium on Theory of Computing, 1989.
A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, November 1979.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Micali, S., Rabin, T. (1991). Collective Coin Tossing Without Assumptions nor Broadcasting. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive