Post-quantum zero-knowledge with space-bounded simulation

DOI10.1007/978-3-032-06754-8_2MaRDI QIDQ6856491zbMATH OpenFDO

Authors Prabhanjan Ananth, Alex Bredariol Grilo

Publication date 19 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-06754-8_2

zbMATH Keywords

post-quantum zero-knowledgequantum polynomial-time algorithmspace-bounded simulation

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• scientific article; zbMATH DE number 1024047 (Why is no real title available?)
• A black-box approach to post-quantum zero-knowledge in constant rounds
• A single quantum cannot be cloned
• Classical cryptographic protocols in a quantum world
• Cryptographic hashing from strong one-way functions (or: one-way product functions and their applications)
• Definitions and properties of zero-knowledge proof systems
• Everlasting multi-party computation
• Foundations of Cryptography
• Local zero knowledge
• Oblivious transfer is in MiniQCrypt
• On the Composition of Zero-Knowledge Proof Systems
• On the concurrent composition of quantum zero-knowledge
• On the impossibility of post-quantum black-box zero-knowledge in constant round
• One-message statistical Zero-Knowledge Proofs and space-bounded verifier
• One-way functions imply secure computation in a quantum world
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Post-quantum resettably-sound zero knowledge
• Post-quantum succinct arguments: breaking the quantum rewinding barrier
• Post-quantum zero knowledge in constant rounds
• Precise Concurrent Zero Knowledge
• Precise time and space simulatable zero-knowledge
• Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
• Quantum money from hidden subspaces
• Quantum proofs of knowledge
• Secure quantum extraction protocols
• The knowledge complexity of interactive proof-systems
• The knowledge tightness of parallel zero-knowledge
• The space-time cost of purifying quantum computations
• Zero-knowledge against quantum attacks
• Zero-knowledge proof systems for GMA

This page was built for publication: Post-quantum zero-knowledge with space-bounded simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6856491)