Definitions and properties of zero-knowledge proof systems
Authors:
- 1 December 1994
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 7 (1) , 1-32
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Relativized perfect zero knowledge is not BPPInformation and Computation, 1991
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Interactive proof systems: Provers that never fail and random selection1987
- Perfect zero-knowledge languages can be recognized in two rounds1987
- How to play ANY mental game1987
- The complexity of perfect zero-knowledge1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol design1986
- How to construct random functionsJournal of the ACM, 1986
- Trading group theory for randomness1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984