Classically verifiable NIZK for QMA with preprocessing
From MaRDI portal
(Redirected from Publication:6134001)
Abstract: We propose three constructions of classically verifiable non-interactive zero-knowledge proofs and arguments (CV-NIZK) for QMA in various preprocessing models. - We construct a CV-NIZK for QMA in the quantum secret parameter model where a trusted setup sends a quantum proving key to the prover and a classical verification key to the verifier. It is information theoretically sound and zero-knowledge. - Assuming the quantum hardness of the learning with errors problem, we construct a CV-NIZK for QMA in a model where a trusted party generates a CRS and the verifier sends an instance-independent quantum message to the prover as preprocessing. This model is the same as one considered in the recent work by Coladangelo, Vidick, and Zhang (CRYPTO '20). Our construction has the so-called dual-mode property, which means that there are two computationally indistinguishable modes of generating CRS, and we have information theoretical soundness in one mode and information theoretical zero-knowledge property in the other. This answers an open problem left by Coladangelo et al, which is to achieve either of soundness or zero-knowledge information theoretically. To the best of our knowledge, ours is the first dual-mode NIZK for QMA in any kind of model. - We construct a CV-NIZK for QMA with quantum preprocessing in the quantum random oracle model. This quantum preprocessing is the one where the verifier sends a random Pauli-basis states to the prover. Our construction uses the Fiat-Shamir transformation. The quantum preprocessing can be replaced with the setup that distributes Bell pairs among the prover and the verifier, and therefore we solve the open problem by Broadbent and Grilo (FOCS '20) about the possibility of NIZK for QMA in the shared Bell pair model via the Fiat-Shamir transformation.
Recommendations
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- Algorithms and Computation
- Black-box constructions for secure computation
- Efficient Fully-Simulatable Oblivious Transfer
- Efficient noninteractive proof systems for bilinear groups
- Efficient oblivious transfer protocols
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Multi-theorem designated-verifier NIZK for QMA
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- New techniques for noninteractive zero-knowledge
- Non-interactive classical verification of quantum computation
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On lattices, learning with errors, random linear codes, and cryptography
- On the round complexity of secure quantum computation
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Post-quantum zero knowledge in constant rounds
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Simulatable Adaptive Oblivious Transfer
- The Knowledge Complexity of Interactive Proof Systems
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Tight adaptive reprogramming in the QROM
- Two-message statistically sender-private OT from LWE
- UC-secure OT from LWE, revisited
- Unconditional Characterizations of Non-interactive Zero-Knowledge
- Universally composable security
Cited in
(6)- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Multi-theorem designated-verifier NIZK for QMA
- A new framework for quantum oblivious transfer
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
- Revocable quantum digital signatures
- Nonadaptive one-way to hiding implies adaptive quantum reprogramming
This page was built for publication: Classically verifiable NIZK for QMA with preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134001)
