Certified everlasting zero-knowledge proof for QMA
From MaRDI portal
Publication:6097264
DOI10.1007/978-3-031-15802-5_9zbMath1516.94034arXiv2109.14163OpenAlexW3210981141MaRDI QIDQ6097264
Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa, Taiga Hiroka
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.14163
Related Items (4)
Public key encryption with secure key leasing ⋮ Cloning games: a general framework for unclonable primitives ⋮ Publicly-verifiable deletion via target-collapsing functions ⋮ Cryptography with certified deletion
Cites Work
- Unnamed Item
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Quantum encryption with certified deletion
- Non-interactive classical verification of quantum computation
- Multi-theorem designated-verifier NIZK for QMA
- On the round complexity of secure quantum computation
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- The round complexity of quantum zero-knowledge
- Classical binding for quantum commitments
- Everlasting Multi-party Computation
- Zero-knowledge against quantum attacks
- Random Oracles in a Quantum World
- Revocable Quantum Timed-Release Encryption
- Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- The Knowledge Complexity of Interactive Proof Systems
- Post-quantum zero knowledge in constant rounds
- Algorithms and Computation
- Advances in Cryptology – CRYPTO 2004
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
- Theory of Cryptography
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
This page was built for publication: Certified everlasting zero-knowledge proof for QMA