Definitions and properties of zero-knowledge proof systems
- 1 December 1994
- journal article
- Published by Springer Science and Business Media LLC in Journal of Cryptology
- Vol. 7 (1), 1-32
- https://doi.org/10.1007/bf00195207
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- On the composition of zero-knowledge proof systemsPublished by Springer Science and Business Media LLC ,2005
- 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 selectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Perfect zero-knowledge languages can be recognized in two roundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- The complexity of perfect zero-knowledgePublished by Association for Computing Machinery (ACM) ,1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- How to construct random functionsJournal of the ACM, 1986
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985