Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
- 1 January 1989
- book chapter
- Published by Springer Nature
- p. 123-136
- https://doi.org/10.1007/bfb0035756
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Cryptographic Capsules: A Disjunctive Primitive for Interactive ProtocolsPublished by Springer Nature ,2000
- A discrete logarithm implementation of perfect zero-knowledge blobsJournal of Cryptology, 1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Zero-knowledge proofs of identityJournal of Cryptology, 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
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948