On the Composition of Zero-Knowledge Proof Systems
- 1 February 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 25 (1), 169-192
- https://doi.org/10.1137/s0097539791220688
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Zero Knowledge Proofs of Knowledge in Two RoundsPublished by Springer Nature ,2001
- How To Construct Constant-Round Zero-Knowledge Proof Systems for NPJournal of Cryptology, 1996
- Definitions and properties of zero-knowledge proof systemsJournal of Cryptology, 1994
- A uniform-complexity treatment of encryption and zero-knowledgeJournal of Cryptology, 1993
- Sparse pseudorandom distributionsRandom Structures & Algorithms, 1992
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Everything Provable is Provable in Zero-KnowledgeLecture Notes in Computer Science, 1990
- On the power of two-point based samplingJournal of Complexity, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Probabilistic encryptionJournal of Computer and System Sciences, 1984