Computationally convincing proofs of knowledge
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 251-262
- https://doi.org/10.1007/bfb0020803
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About HowPublished by Springer Nature ,2000
- How convincing is your protocol?ACM SIGACT News, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- 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
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- The complexity of perfect zero-knowledgePublished by Association for Computing Machinery (ACM) ,1987
- Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986