The Complexity of Zero Knowledge
From MaRDI portal
Publication:5458822
DOI10.1007/978-3-540-77050-3_5zbMath1135.68444OpenAlexW1565801357MaRDI QIDQ5458822
Publication date: 24 April 2008
Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_5
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-deterministic exponential time has two-prover interactive protocols
- Bit commitment using pseudorandomness
- Statistical zero-knowledge languages can be recognized in two rounds
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Does co-NP have short interactive proofs ?
- Minimum disclosure proofs of knowledge
- Perfect zero-knowledge arguments for NP using any one-way permutation
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- Definitions and properties of zero-knowledge proof systems
- On the power of multi-prover interactive protocols
- Trading help for interaction in statistical zero-knowledge proofs
- On relationships between statistical zero-knowledge proofs
- The complexity of computing a Nash equilibrium
- Zero knowledge with efficient provers
- The random oracle methodology, revisited
- Proof verification and the hardness of approximation problems
- On zero-knowledge proofs (extended abstract)
- SZK Proofs for Black-Box Group Problems
- A complete problem for statistical zero knowledge
- Quantum lower bound for the collision problem
- Bounded-concurrent secure multi-party computation with a dishonest majority
- New and improved constructions of non-malleable cryptographic protocols
- Worst-Case to Average-Case Reductions Revisited
- Universal Arguments and their Applications
- The Knowledge Complexity of Interactive Proof Systems
- Probabilistic checking of proofs
- New directions in cryptography
- A Pseudorandom Generator from any One-way Function
- Algebraic methods for interactive proof systems
- IP = PSPACE
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- Interactive proofs and the hardness of approximating cliques
- Computationally Sound Proofs
- On the Composition of Zero-Knowledge Proof Systems
- Advances in Cryptology - CRYPTO 2003
- Zero Knowledge and Soundness Are Symmetric
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Adiabatic Quantum State Generation
- On Worst‐Case to Average‐Case Reductions for NP Problems
- An Unconditional Study of Computational Zero Knowledge
- Theory of Cryptography
This page was built for publication: The Complexity of Zero Knowledge
