Post-quantum zero knowledge in constant rounds

DOI10.1145/3357713.3384324OpenAlexW2990348468MaRDI QIDQ5144915

Omri Shmueli, Nir Bitansky

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

zero-knowledgepost-quantum cryptographynon-black-box simulation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (22)

A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ On the concurrent composition of quantum zero-knowledge ⋮ One-way functions imply secure computation in a quantum world ⋮ Impossibility of quantum virtual black-box obfuscation of classical circuits ⋮ Non-malleable commitments against quantum attacks ⋮ Certified everlasting zero-knowledge proof for QMA ⋮ On the impossibility of key agreements from quantum random oracles ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Post-quantum insecurity from LWE ⋮ Universal reductions: reductions relative to stateful oracles ⋮ Post-quantum resettably-sound zero knowledge ⋮ The round complexity of quantum zero-knowledge ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ Post-quantum multi-party computation ⋮ Secure software leasing ⋮ Oblivious transfer is in MiniQCrypt ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge

This page was built for publication: Post-quantum zero knowledge in constant rounds