Non-interactive zero-knowledge arguments for QMA, with preprocessing

DOI10.1007/978-3-030-56877-1_28zbMath1504.94125arXiv1911.07546OpenAlexW3081357568MaRDI QIDQ2104244

Tina Zhang, Andrea Coladangelo, Thomas Vidick

Publication date: 7 December 2022

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

zbMATH Keywords

zero-knowledgeargument systemsQMAnon-interactive proof

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ On the concurrent composition of quantum zero-knowledge ⋮ Certified everlasting zero-knowledge proof for QMA ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ A new framework for quantum oblivious transfer ⋮ The round complexity of quantum zero-knowledge ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge

Uses Software

• Pinocchio

Cites Work

• Definitions and properties of zero-knowledge proof systems
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Quantum Proofs of Knowledge
• Zero-knowledge against quantum attacks
• Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
• Noninteractive Zero-Knowledge
• The knowledge complexity of interactive proof-systems
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Fiat-Shamir: from practice to theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-interactive zero-knowledge arguments for QMA, with preprocessing