Limits on the security of coin flips when half the processors are faulty

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Limits on the security of coin flips when half the processors are faulty

Full text

Pdf (363 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the eighteenth annual ACM symposium on Theory of computing table of contents

Berkeley, California, United States

Pages: 364 - 369

Year of Publication: 1986

ISBN:0-89791-193-8

Author

R Cleve

Department of Computer Science, University of Toronto, Toronto, Canada M5S 1A4

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 56, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/12130.12168 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Awerbuch, B., Blum, M., Chor, B., Goldwasser, S., Micali, S., How to Implement Bracha's O{log n) Byzantine Agreement Algorithm, Manuscript, 1985.
	2	Ben-Or, M., Linial, N., Collective Coin Flipping, Robust Voting Schemes and Minima of Banzhaf Values, 26th FOCS, 1985.
	3	Blum, M., Coin Flipping by Telephone-a Protocol for Solving Impossible Problems, Spring COMPCON Conference, 1982.
	4	Broder, A., Dolce, D., Flipping Coins in Many Pockets, 25th FOCS, 1984.
	5	Luby~ M., Micali, S., Rackoff, C., How to Simultaneously Exchange a Secret Bit by Flipping a Symetrically Biased Coin 24th FOCS, 1983.

CITED BY 9

	Matthias Fitzi , Daniel Gottesman , Martin Hirt , Thomas Holenstein , Adam Smith, Detectable byzantine agreement secure against faulty majorities, Proceedings of the twenty-first annual symposium on Principles of distributed computing, July 21-24, 2002, Monterey, California
	Donald Beaver, Server-assisted cryptography, Proceedings of the 1998 workshop on New security paradigms, p.92-106, September 22-26, 1998, Charlottesville, Virginia, United States
	Matt Lepinski , Silvio Micali , Chris Peikert , Abhi Shelat, Completely fair SFE and coalition-safe cheap talk, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, July 25-28, 2004, St. John's, Newfoundland, Canada
	Oded Goldreich, Cryptography and cryptographic protocols, Distributed Computing, v.16 n.2-3, p.177-199, September 2003
	André Adelsbach , Markus Rohe , Ahmad-Reza Sadeghi, Overcoming the obstacles of zero-knowledge watermark detection, Proceedings of the 2004 workshop on Multimedia and security, September 20-21, 2004, Magdeburg, Germany
	Oded Goldreich, Foundations of cryptography: a primer, Foundations and Trends® in Theoretical Computer Science, v.1 n.1, p.1-116, April 2005
	Dov S. Gordon , Hazay Carmit , Jonathan Katz , Yehuda Lindell, Complete fairness in secure two-party computation, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
	Jonathan Katz, On achieving the "best of both worlds" in secure multiparty computation, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11-13, 2007, San Diego, California, USA
	M. Choudary Gorantla , Colin Boyd , Juan Manuel González Nieto, Universally composable contributory group key exchange, Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, March 10-12, 2009, Sydney, Australia