The round complexity of quantum zero-knowledge
From MaRDI portal
Recommendations
- On the round complexity of secure quantum computation
- scientific article; zbMATH DE number 1759795
- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
- Post-quantum zero knowledge in constant rounds
- Round-optimal zero-knowledge proofs of knowledge for NP
- Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge
- The Exact Round Complexity of Secure Computation
- The Complexity of Zero Knowledge
- Round-optimal perfect zero-knowledge proofs
- On the concurrent composition of quantum zero-knowledge
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- 2-round zero knowledge and proof auditors
- Advances in Cryptology - CRYPTO 2003
- Classical cryptographic protocols in a quantum world
- Classical verification of quantum computations with efficient verifier
- Definitions and properties of zero-knowledge proof systems
- Distinguisher-dependent simulation in two rounds and its applications
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully homomorphic encryption using ideal lattices
- Fully simulatable quantum-secure coin-flipping and applications
- How to construct constant-round zero-knowledge proof systems for NP
- Lattice-based FHE as secure as PKE
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Maliciously circuit-private FHE
- Multi-collision resistance: a paradigm for keyless hash functions
- Non-interactive classical verification of quantum computation
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- On lattices, learning with errors, random linear codes, and cryptography
- On round optimal statistical zero knowledge arguments
- On the concurrent composition of quantum zero-knowledge
- Post-quantum zero knowledge in constant rounds
- Pseudorandomness of ring-LWE for any ring and modulus
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Quantum proofs of knowledge
- Secure quantum extraction protocols
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Statistical ZAP arguments
- Statistical ZAPR arguments from bilinear maps
- Statistical Zaps and new oblivious transfer protocols
- Statistical witness indistinguishability (and more) in two messages
- Synchronized aggregate signatures from the RSA assumption
- The Knowledge Complexity of Interactive Proof Systems
- Trapdoor hash functions and their applications
- Two-message statistically sender-private OT from LWE
- Weak zero-knowledge beyond the black-box barrier
Cited in
(10)- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
- Secure quantum extraction protocols
- On the concurrent composition of quantum zero-knowledge
- On the round complexity of secure quantum computation
- On round optimal statistical zero knowledge arguments
- Quantum rewinding for many-round protocols
- Multi-theorem designated-verifier NIZK for QMA
- Certified everlasting zero-knowledge proof for QMA
- Post-quantum resettably-sound zero knowledge
This page was built for publication: The round complexity of quantum zero-knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695629)
