Perfect zero-knowledge in constant rounds

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Perfect zero-knowledge in constant rounds

Full text

Pdf (930 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-second annual ACM symposium on Theory of computing table of contents

Baltimore, Maryland, United States

Pages: 482 - 493

Year of Publication: 1990

ISBN:0-89791-361-2

Authors

M. Bellare	MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA
S. Micali	MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA
R. Ostrovsky	MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 17, Citation Count: 8

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/100216.100283 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	Gilles Brassard , Claude Crépeau, Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, p.123-136, July 11-15, 1989
	2	L. Fortnow, The complexity of perfect zero-knowledge, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.204-209, January 1987, New York, New York, United States [doi>10.1145/28395.28418]
	3	Oded Goldreich , Hugo Krawczyk, On the Composition of Zero-Knowledge Proof Systems, Proceedings of the 17th International Colloquium on Automata, Languages and Programming, p.268-282, July 16-20, 1990
	4	[4] Goldreich, O., S. Micali, and A. Wigderson, "Proofs that Yield Nothing but their Validity", Technical Report #498, Technion, 1988; preliminary version in FOCS 86.
	5	S. Goldwasser , S. Micali , C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, v.18 n.1, p.186-208, Feb. 1989 [doi>10.1137/0218012]
	6	Shafi Goldwasser , Silvio Micali , Ronald L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal on Computing, v.17 n.2, p.281-308, April 1988 [doi>10.1137/0217017]
	7	[7] Tompa, M. and H. Woll, "Random Self Reducibility and Zero Knowledge Interactive Proofs of Possession of Information," FOCS 87.

CITED BY 8

	Ran Canetti , Joe Kilian , Erez Petrank , Alon Rosen, Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.570-579, July 2001, Hersonissos, Greece
	Giovanni Di Crescenzo , Kouichi Sakurai , Moti Yung, On zero-knowledge proofs (extended abstract): “from membership to decision”, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.255-264, May 21-23, 2000, Portland, Oregon, United States
	Rajiv Gupta , Scott A. Smolka , Shaji Bhaskar, On randomization in sequential and distributed algorithms, ACM Computing Surveys (CSUR), v.26 n.1, p.7-86, March 1994
	Yvo Desmedt , Mike Burmester, Towards practical “proven secure” authenticated key distribution, Proceedings of the 1st ACM conference on Computer and communications security, p.228-231, November 03-05, 1993, Fairfax, Virginia, United States
	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
	Minh-Huyen Nguyen , Salil Vadhan, Zero knowledge with efficient provers, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
	Mike Burmester , Yvo G. Desmedt , Fred Piper , Michael Walker, A General Zero-Knowledge Scheme, Designs, Codes and Cryptography, v.12 n.1, p.13-37, Sept. 1997
	M. Bellare , S. Micali , R. Ostrovsky, The (true) complexity of statistical zero knowledge, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.494-502, May 13-17, 1990, Baltimore, Maryland, United States