Spatial Isolation Implies Zero Knowledge Even in a Quantum World
From MaRDI portal
Publication:5066952
DOI10.1145/3511100OpenAlexW2792003634MaRDI QIDQ5066952
Tom Gur, Alessandro Chiesa, Nicholas Spooner, Michael A. Forbes
Publication date: 31 March 2022
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/130726/1/WRAP-spatial-isolation-zero-quantum-world-Gur-2019.pdf
algebraic complexityzero knowledgemulti-prover interactive proofssumcheck protocolinteractive PCPsquantum entangled strategies
Related Items
On succinct non-interactive arguments in relativized worlds ⋮ The round complexity of quantum zero-knowledge
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The black-box query complexity of polynomial summation
- Non-deterministic exponential time has two-prover interactive protocols
- Statistical zero-knowledge languages can be recognized in two rounds
- Does co-NP have short interactive proofs ?
- Definitions and properties of zero-knowledge proof systems
- Zero knowledge protocols from succinct constraint detection
- Deterministic polynomial identity testing in non-commutative models
- Power sums over finite subspaces of a field
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
- IP = PSPACE Using Error-Correcting Codes
- Quantum Proofs of Knowledge
- Zero-knowledge against quantum attacks
- Algebrization
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Entangled Games Are Hard to Approximate
- Delegating Computation
- Interactive PCP
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
- The Knowledge Complexity of Interactive Proof Systems
- Algebraic methods for interactive proof systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Coding theorem and strong converse for quantum channels
- Robust Characterizations of Polynomials with Applications to Program Testing
- Algorithms and Computation
- Advances in Cryptology – CRYPTO 2004
- Constant-round interactive proofs for delegating computation
- Parallel repetition of entangled games
- General Properties of Quantum Zero-Knowledge Proofs
- Robust locally testable codes and products of codes
