On the communication complexity of zero-knowledge proofs
From MaRDI portal
Publication:1261016
DOI10.1007/BF02620135zbMath0782.68064WikidataQ62472241 ScholiaQ62472241MaRDI QIDQ1261016
René Peralta, Joan. Boyar, Carstent Lund
Publication date: 29 August 1993
Published in: Journal of Cryptology (Search for Journal in Brave)
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A discrete logarithm implementation of perfect zero-knowledge blobs
- Probabilistic encryption
- Short propositional formulas represent nondeterministic computations
- Minimum disclosure proofs of knowledge
- Zero-knowledge proofs of identity
- Some simplified NP-complete graph problems
- Zero-Knowledge Simulation of Boolean Circuits
- The Knowledge Complexity of Interactive Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Subquadratic zero-knowledge
- The complexity of theorem-proving procedures