Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing

Full text

Pdf (965 KB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing table of contents

Philadelphia, Pennsylvania, United States

Pages: 191 - 200

Year of Publication: 1996

ISBN:0-89791-800-2

Authors

Mihir Bellare	Department of Computer Science & Engineering, Mail Code 0114, University of California at San Diego, 9500 Gilman Drive, La Jolla, CA
Juan A. Garay	CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, and IBM T.J. Watson Research Center, PO Box 704, Yorktown Heights, New York
Tal Rabin	MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 9, Citation Count: 1

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/248052.248090 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	Amotz Bar-Noy , Xiaotie Deng , Juan A. Garay , Tiko Kameda, Optimal Amortized Distributed Consensus (Extended Abstract), Proceedings of the 5th International Workshop on Distributed Algorithms, p.95-107, October 07-09, 1991
	2	Donald Beaver , Nicol So, Global, unpredictable bit generation without broadcast, Workshop on the theory and application of cryptographic techniques on Advances in cryptology, p.424-434, January 1994, Lofthus, Norway
	3	M. Bellare, J. Garay, and T. Rabin. Fast Bulk Verification of Discrete Logs and DSA and RSA Signatures, 1996. In preparation.
	4	Michael Ben-Or , Shafi Goldwasser , Avi Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.1-10, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62213]
	5	E. Berlek~mp and L. Welch. Error correction of algebraic block codes. US Patent 4,633,470.
	6	M. Blum. Coin Flipping by Telephone- A protocol for solving impossible problems. In IEEE Spring Compcon, pages 133-137. IEEE, 1982.
	7	Manuel Blum , Silvio Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal on Computing, v.13 n.4, p.850-864, Nov. 1984 [doi>10.1137/0213053]
	8	Ran Canetti , Amir Herzberg, Maintaining Security in the Presence of Transient Faults, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.425-438, August 21-25, 1994
	9	David Chaum , Claude Crépeau , Ivan Damgard, Multiparty unconditionally secure protocols, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.11-19, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62214]
	10	B. Chor, S. Goldwasser, S. Micah, and B. Awerbuch. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In Proceeding ~6th Annual Symposium on the Foundations of Gomputer Science, pages 383-395. IEEE, 1985.
	11	C. Dwork, D. Shmoys, and L. Stockmayer. Fliping Presuasively in Constant Expected Time. In Proceeding ~Tth Annual Symposium on the Foundations of Computer Science, pages 222-232. IEEE, 1986.
	12	P. Feldman. A Practical Scheme for Non-Interactive Verifiable Secret Sharing. In Proceeding 28th Annual Symposium on the Foundations of Computer Science, pages 427-437. IEEE, 1987.
	13	P. Felma.n and S. Micali. Byzantine Agreement in Constant Expected Time (and trusting no one). In Proceeding ~6th Annual Symposium on the Foundations oj~ Uomputer Science, pages 267-276. IEEE, 1985.
	14	Paul Feldman , Silvio Micali, Optimal algorithms for Byzantine agreement, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.148-161, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62225]
	15	M. R. Ga.rey and D. S.Johnson. Computers and Intractability: a guide to NP-Completeness. W. I-t. Freeman, ed. N.Y., 1979.
	16	Amir Herzberg , Stanislaw Jarecki , Hugo Krawczyk , Moti Yung, Proactive Secret Sharing Or: How to Cope With Perpetual Leakage, Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, p.339-352, August 27-31, 1995
	17	M. Rabin. Randomized Byzantine Generals. In Proceeding ~~th Annual $gtmposium on the Foundations of Uomputer Science, pages 403-409. iEEE, 1983.
	18	Adi Shamir, How to share a secret, Communications of the ACM, v.22 n.11, p.612-613, Nov. 1979 [doi>10.1145/359168.359176]
	19	A. Yao. Theory and apphcafions of trapdoor functions. In Proceedin9 ~Tth Annual Symposium on the Foundations of Computer Science. IEEE, 1986.