Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

doi:10.1145/116825.116852

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Full Text:

PDF

Buy this Article

Authors:	Oded Goldreich	Technion, Haifa, Israel
	Silvio Micali	Massachusetts Institute of Technology, Cambridge
	Avi Wigderson	Hebrew Univ., Jerusalem, Israel

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 38 Issue 3, July 1991
Pages 690-728
ACM New York, NY, USA
table of contents doi>10.1145/116825.116852

	1991 Article
Bibliometrics
· Downloads (6 Weeks): 37 · Downloads (12 Months): 210 · Downloads (cumulative): 2,809 · Citation Count: 283

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: cryptographic protocols fault tolerant distributed computing graph isomorphism interactive proofs languages methodological design of protocols np one-way functions proof systems proof theory theory zero-knowledge

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder