Post-quantum resettably-sound zero knowledge

DOI10.1007/978-3-030-90459-3_3MaRDI QIDQ2695624zbMATH OpenOpenAlexFDO

Authors Nir Bitansky, Michael Kellner, Omri Shmueli

Publication date 31 March 2023

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

Mathematics Subject Classification ID

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

Recommendations

• A black-box approach to post-quantum zero-knowledge in constant rounds
• Nearly simultaneously resettable black-box zero knowledge
• The round complexity of quantum zero-knowledge
• Resettably sound zero-knowledge arguments from OWFs -- the (semi) black-box way

Cites work

• 4-round Luby-Rackoff construction is a qPRP
• 4-round resettably-sound zero knowledge
• A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
• A single quantum cannot be cloned
• Advances in Cryptology – CRYPTO 2004
• Algorithms and Computation
• Collapse-binding quantum commitments without random oracles
• Computationally binding quantum commitments
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• From obfuscation to the security of Fiat-Shamir for proofs
• How to construct constant-round zero-knowledge proof systems for NP
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1722687 (Why is no real title available?)
• scientific article; zbMATH DE number 6492475 (Why is no real title available?)
• scientific article; zbMATH DE number 5568627 (Why is no real title available?)
• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• Impossibility of quantum virtual black-box obfuscation of classical circuits
• Lower bounds for non-black-box zero knowledge
• Magic functions
• Making existential-unforgeable signatures strongly unforgeable in the quantum random-oracle model
• Minimum disclosure proofs of knowledge
• Multi-collision resistance: a paradigm for keyless hash functions
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Non-black-box simulation from one-way functions and applications to resettable security
• Non-black-box simulation from one-way functions and applications to resettable security
• Non-black-box simulation in the fully concurrent setting
• Non-interactive zero-knowledge proofs in the quantum random oracle model
• On lattices, learning with errors, random linear codes, and cryptography
• On non-black-box simulation and the impossibility of approximate obfuscation
• On the (im)possibility of obfuscating programs
• On the composition of public-coin zero-knowledge protocols
• On the Composition of Zero-Knowledge Proof Systems
• On the existence of three round zero-knowledge proofs
• On the impossibility of approximate obfuscation and applications to resettable cryptography
• Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
• Post-quantum zero knowledge in constant rounds
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Quantum FHE (almost) as secure as classical
• Quantum position verification in the random oracle model
• Quantum security proofs using semi-classical oracles
• Random oracles in a quantum world
• Resettable zero-knowledge (extended abstract)
• Resettably Secure Computation
• Resettably-sound resettable zero knowledge in constant rounds
• Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
• Revisiting post-quantum Fiat-Shamir
• Revisiting TESLA in the quantum random oracle model
• Secure quantum extraction protocols
• Secure signatures and chosen ciphertext security in a quantum computing world
• Secure software leasing
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• Simultaneously resettable arguments of knowledge
• Stateless Cryptographic Protocols
• Statistical ZAP arguments
• Statistical Zaps and new oblivious transfer protocols
• Strict Polynomial-Time in Simulation and Extraction
• Succinct arguments in the quantum random oracle model
• The Knowledge Complexity of Interactive Proof Systems
• The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
• Weak zero-knowledge beyond the black-box barrier

Cited in

(5)

• On the impossibility of key agreements from quantum random oracles
• Resettable statistical zero-knowledge for NP
• Post-quantum zero-knowledge with space-bounded simulation
• Improved quantum lifting by coherent measure-and-reprogram
• NISQ security and complexity via simple classical reasoning

This page was built for publication: Post-quantum resettably-sound zero knowledge

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