Zero-knowledge proof systems for QMA
From MaRDI portal
Publication:6663093
DOI10.1137/18M1193530MaRDI QIDQ6663093
Zhengfeng Ji, Anne Broadbent, John Watrous, Fang Song
Publication date: 14 January 2025
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bit commitment using pseudorandomness
- Quantum Arthur-Merlin games
- Definitions and properties of zero-knowledge proof systems
- PSPACE has constant-round quantum interactive proof systems
- How to construct constant-round zero-knowledge proof systems for NP
- The Heisenberg representation of quantum computers
- Quantum 3-SAT Is QMA\(_1\)-complete
- Quantum One-Time Programs
- Quantum Proofs of Knowledge
- Actively Secure Two-Party Evaluation of Any Quantum Operation
- Zero-knowledge against quantum attacks
- A Note on Quantum Security for Post-Quantum Cryptography
- Fully Simulatable Quantum-Secure Coin-Flipping and Applications
- Multiple-particle interference and quantum error correction
- Increasing the power of the verifier in Quantum Zero Knowledge
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Consistency of Local Density Matrices Is QMA-Complete
- Quantum-Secure Coin-Flipping and Applications
- The Knowledge Complexity of Interactive Proof Systems
- Coin flipping by telephone a protocol for solving impossible problems
- Quantum computations: algorithms and error correction
- A Pseudorandom Generator from any One-way Function
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- How to Verify a Quantum Computation
- Foundations of Cryptography
- Compression of quantum multi-prover interactive proofs
- Quantum proof systems for iterated exponential time, and beyond
- Advances in Cryptology – CRYPTO 2004
- A single quantum cannot be cloned
- The Complexity of the Local Hamiltonian Problem
This page was built for publication: Zero-knowledge proof systems for QMA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663093)
