Multi-theorem designated-verifier NIZK for QMA

DOI10.1007/978-3-030-84242-0_14zbMath1485.94121OpenAlexW3192219871MaRDI QIDQ2120083

Omri Shmueli

Publication date: 31 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Certified everlasting zero-knowledge proof for QMA ⋮ Classically verifiable NIZK for QMA with preprocessing

Cites Work

• Two-message statistically sender-private OT from LWE
• Non-interactive classical verification of quantum computation
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Reusable designated-verifier NIZKs for all NP from CDH
• New constructions of reusable designated-verifier NIZKs
• Maliciously Circuit-Private FHE
• The random oracle methodology, revisited
• On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
• Consistency of Local Density Matrices Is QMA-Complete
• The Knowledge Complexity of Interactive Proof Systems
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Fiat-Shamir: from practice to theory
• Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item

This page was built for publication: Multi-theorem designated-verifier NIZK for QMA