Achieving independence efficiently and securely

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Achieving independence efficiently and securely

Full text

Pdf (743 KB)

Source

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

Ottowa, Ontario, Canada

Pages: 130 - 136

Year of Publication: 1995

ISBN:0-89791-710-3

Author

Rosario Gennaro

Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 13, Citation Count: 4

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/224964.224979 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	Josh C Benaloh , Moti Yung, Distributing the power of a government to enhance the privacy of voters, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.52-62, August 11-13, 1986, Calgary, Alberta, Canada [doi>10.1145/10590.10595]
	2	Manuel Blum , Alfredo De Santis , Silvio Micali , Giuseppe Persiano, Noninteractive zero-knowledge, SIAM Journal on Computing, v.20 n.6, p.1084-1118, Dec. 1991 [doi>10.1137/0220068]
	3	Benny Chor and Cynthia Dwork. Randomization in byzantine agreement. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research. JAI Press, 1989.
	4	Benny Chor, Shaft Goldwasser, Silvio Mica}i, and Baruch Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In ~6th IEEE Symposium on Foundations of Computer Science, pages 383-395, 1985.
	5	Benny Chor , Michael O. Rabin, Achieving independence in logarithmic number of rounds, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.260-268, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41862]
	6	Danny Dolev , Cynthia Dwork , Moni Naor, Non-malleable cryptography, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.542-552, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103474]
	7	Uri Feige, Dror Lapidot, and Adi Shamir. Multiple non-interactive zero-knowledge proofs. In 31st IEEE Symposium on Foundations of Computer Science, 1990.
	8	Paul Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous byzantine agreement. In 20th A CM Symposium on Theory o/Computing, 1988.
	9	Rosario Gennaro. A note on the definition of zeroknowledge arguments. Manuscript, submitted to IPL.
	10	Rosario Gennaro and Silvio Micali. Verifiable secret sharing as secure computation. In EUROCRYPT'95, Lecture Notes in Computer Science. Springer-Verlag, 1995.
	11	Oded Goldreich , Silvio Micali , Avi Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Journal of the ACM (JACM), v.38 n.3, p.690-728, July 1991 [doi>10.1145/116825.116852]
	12	Shaft Goldwasser and Silvio Micali. Probabilisitc encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
	13	Kazue Sako , Joe Kilian, Secure Voting Using Partially Compatible Homomorphisms, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.411-424, August 21-25, 1994
	14	Alfredo De Santis and Giuseppe Persiano. Zeroknowledge proofs of knowledge without interaction. In 83rd iEEE Symposium on Foundations of Computer Science, 1992.
	15	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]

CITED BY 4

	C. Andrew Neff, A verifiable secret shuffle and its application to e-voting, Proceedings of the 8th ACM conference on Computer and Communications Security, November 05-08, 2001, Philadelphia, PA, USA
	Giovanni Di Crescenzo , Yuval Ishai , Rafail Ostrovsky, Non-interactive and non-malleable commitment, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.141-150, May 24-26, 1998, Dallas, Texas, United States
	Alejandro Hevia , Marcos Kiwi, Electronic jury voting protocols, Theoretical Computer Science, v.321 n.1, p.73-94, June 16, 2004
	Alejandro Hevia , Daniele Micciancio, Simultaneous broadcast revisited, Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, July 17-20, 2005, Las Vegas, NV, USA