Classically verifiable NIZK for QMA with preprocessing

DOI10.1007/978-3-031-22972-5_21zbMath1519.94177arXiv2102.09149MaRDI QIDQ6134001

Takashi Yamakawa, Tomoyuki Morimae

Publication date: 21 August 2023

Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.09149

zbMATH Keywords

quantum zero-knowledgeQMAconsistency of local density matrices

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (2)

A new framework for quantum oblivious transfer ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)

Cites Work

• Unnamed Item
• Two-message statistically sender-private OT from LWE
• The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
• Non-interactive zero-knowledge arguments for QMA, with preprocessing
• UC-secure OT from LWE, revisited
• Non-interactive classical verification of quantum computation
• Multi-theorem designated-verifier NIZK for QMA
• On the round complexity of secure quantum computation
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Revisiting post-quantum Fiat-Shamir
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• Black-box constructions for secure computation
• Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
• A Framework for Efficient and Composable Oblivious Transfer
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Efficient Noninteractive Proof Systems for Bilinear Groups
• Universally Composable Security
• Post-quantum zero knowledge in constant rounds
• Algorithms and Computation
• New Techniques for Noninteractive Zero-Knowledge
• Simulatable Adaptive Oblivious Transfer
• Unconditional Characterizations of Non-interactive Zero-Knowledge
• Efficient Fully-Simulatable Oblivious Transfer
• QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
• On lattices, learning with errors, random linear codes, and cryptography
• Tight adaptive reprogramming in the QROM

This page was built for publication: Classically verifiable NIZK for QMA with preprocessing