General Properties of Quantum Zero-Knowledge Proofs
From MaRDI portal
Publication:5445501
DOI10.1007/978-3-540-78524-8_7zbMath1162.94377arXiv0705.1129OpenAlexW1518796684MaRDI QIDQ5445501
Publication date: 5 March 2008
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.1129
Related Items
Complete Problem for Perfect Zero-Knowledge Quantum Proof ⋮ Quantum coin hedging, and a counter measure ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ General properties of quantum bit commitments (extended abstract) ⋮ Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks ⋮ Protocols for quantum binary voting ⋮ On the obfuscatability of quantum point functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical zero-knowledge languages can be recognized in two rounds
- Quantum Arthur-Merlin games
- On the limits of nonapproximability of lattice problems
- PSPACE has constant-round quantum interactive proof systems
- On relationships between statistical zero-knowledge proofs
- Zero-knowledge against quantum attacks
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- A complete problem for statistical zero knowledge
- The complexity of promise problems with applications to public-key cryptography
- The Knowledge Complexity of Interactive Proof Systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- Algorithms and Computation
- Advances in Cryptology – CRYPTO 2004
- An Unconditional Study of Computational Zero Knowledge