Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- 1 July 1991
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 38 (3) , 690-728
- https://doi.org/10.1145/116825.116852
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Graph isomorphism is in the low hierarchyPublished by Springer Nature ,2006
- On the composition of zero-knowledge proof systemsPublished by Springer Nature ,2005
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Everything in NP can be argued in perfect zero-knowledge in a bounded number of roundsPublished by Springer Nature ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- ObituaryJournal of Computer and System Sciences, 1984
- How to share a secretCommunications of the ACM, 1979
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976