A black-box approach to post-quantum zero-knowledge in constant rounds

DOI10.1007/978-3-030-84242-0_12zbMath1486.94089arXiv2011.02670OpenAlexW3110003886MaRDI QIDQ2120081

Takashi Yamakawa, Kai-Min Chung, Nai-Hui Chia

Publication date: 31 March 2022

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

security soundness NP black-box zero-knowledge proof quantum attack constant round interactive proof post-quantum one-way functions

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (3)

Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ New constructions of collapsing hashes ⋮ Post-quantum insecurity from LWE

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Quantum FHE (almost) as secure as classical
Constant-round perfect zero-knowledge computationally convincing protocols
Bit commitment using pseudorandomness
On the existence of three round zero-knowledge proofs
Distinguisher-dependent simulation in two rounds and its applications
How to construct constant-round zero-knowledge proof systems for NP
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
Noninteractive zero knowledge for NP from (Plain) Learning With Errors
Quantum lightning never strikes the same state twice
Point Obfuscation and 3-Round Zero-Knowledge
Quantum Proofs of Knowledge
Zero-knowledge against quantum attacks
Collapse-Binding Quantum Commitments Without Random Oracles
Magic Functions
A complete problem for statistical zero knowledge
Lossy trapdoor functions and their applications
Strict polynomial-time in simulation and extraction
Black-Box Constructions of Two-Party Protocols from One-Way Functions
The Knowledge Complexity of Interactive Proof Systems
A Pseudorandom Generator from any One-way Function
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
Foundations of Cryptography
Foundations of Cryptography
Post-quantum zero knowledge in constant rounds
Public-key cryptosystems from the worst-case shortest vector problem
Algorithms and Computation
Weak zero-knowledge beyond the black-box barrier
Multi-collision resistance: a paradigm for keyless hash functions
From Weak to Strong Zero-Knowledge and Applications
Advances in Cryptology – CRYPTO 2004
Concurrent zero-knowledge
Classical hardness of learning with errors
Computationally Binding Quantum Commitments
On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: A black-box approach to post-quantum zero-knowledge in constant rounds