The round complexity of quantum zero-knowledge

DOI10.1007/978-3-030-90459-3_5OpenAlexW3214019918MaRDI QIDQ2695629

Orestis Chardouvelis, Giulio Malavolta

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_5

zbMATH Keywords

post-quantum securityconstant-round statistical zero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

Certified everlasting zero-knowledge proof for QMA

Cites Work

• Definitions and properties of zero-knowledge proof systems
• Two-message statistically sender-private OT from LWE
• Synchronized aggregate signatures from the RSA assumption
• Statistical witness indistinguishability (and more) in two messages
• Distinguisher-dependent simulation in two rounds and its applications
• How to construct constant-round zero-knowledge proof systems for NP
• Statistical ZAPR arguments from bilinear maps
• Statistical ZAP arguments
• Statistical Zaps and new oblivious transfer protocols
• Non-interactive zero-knowledge arguments for QMA, with preprocessing
• Secure quantum extraction protocols
• Non-interactive classical verification of quantum computation
• Classical verification of quantum computations with efficient verifier
• On the concurrent composition of quantum zero-knowledge
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Trapdoor hash functions and their applications
• On round optimal statistical zero knowledge arguments
• Maliciously Circuit-Private FHE
• Quantum Proofs of Knowledge
• Zero-knowledge against quantum attacks
• Lattice-based FHE as secure as PKE
• Fully Simulatable Quantum-Secure Coin-Flipping and Applications
• 2-round zero knowledge and proof auditors
• The Knowledge Complexity of Interactive Proof Systems
• Pseudorandomness of ring-LWE for any ring and modulus
• Spatial Isolation Implies Zero Knowledge Even in a Quantum World
• Post-quantum zero knowledge in constant rounds
• Fully homomorphic encryption using ideal lattices
• Classical Cryptographic Protocols in a Quantum World
• Weak zero-knowledge beyond the black-box barrier
• Multi-collision resistance: a paradigm for keyless hash functions
• Advances in Cryptology - CRYPTO 2003
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item

This page was built for publication: The round complexity of quantum zero-knowledge