Multi-theorem designated-verifier NIZK for QMA
From MaRDI portal
Publication:2120083
Recommendations
Cites work
- Consistency of Local Density Matrices Is QMA-Complete
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Fiat-Shamir: from practice to theory
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- Maliciously circuit-private FHE
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- New constructions of reusable designated-verifier NIZKs
- Non-interactive classical verification of quantum computation
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On lattices, learning with errors, random linear codes, and cryptography
- On non-black-box simulation and the impossibility of approximate obfuscation
- Reusable designated-verifier NIZKs for all NP from CDH
- The Knowledge Complexity of Interactive Proof Systems
- The random oracle methodology, revisited.
- Two-message statistically sender-private OT from LWE
Cited in
(8)- Compact designated verifier NIZKs from the CDH assumption without pairings
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Reusable designated-verifier NIZKs for all NP from CDH
- New constructions of reusable designated-verifier NIZKs
- Fine-grained verifier NIZK and its applications
- Certified everlasting zero-knowledge proof for QMA
- Classically verifiable NIZK for QMA with preprocessing
- The round complexity of proofs in the bounded quantum storage model
This page was built for publication: Multi-theorem designated-verifier NIZK for QMA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120083)