A Note on the Instantiability of the Quantum Random Oracle

DOI10.1007/978-3-030-44223-1_27MaRDI QIDQ5041239zbMATH OpenOpenAlexFDO

Authors Edward Eaton, Fang Song

Publication date 13 October 2022

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-44223-1_27

zbMATH Keywords

random oracle modelsignature scheme

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Random oracles in a quantum world
• Succinct arguments in the quantum random oracle model
• On the impossibility of key agreements from quantum random oracles
• Bounds on Instantaneous Nonlocal Quantum Computation
• Succinct blind Quantum computation using a random oracle
• A note on Shor's quantum algorithm
• Physical Aspects of Oracles for Randomness and Hadamard’s Conjecture
• Online-extractability in the quantum random-oracle model

Cites work

• scientific article; zbMATH DE number 1088907 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
• A modular analysis of the Fujisaki-Okamoto transformation
• Advances in Cryptology - EUROCRYPT 2004
• Classical cryptographic protocols in a quantum world
• Computationally Sound Proofs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to record quantum queries, and applications to quantum indifferentiability
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Leighton-Micali hash-based signatures in the quantum random-oracle model
• Making existential-unforgeable signatures strongly unforgeable in the quantum random-oracle model
• Mitigating multi-target attacks in hash-based signatures
• Non-interactive zero-knowledge proofs in the quantum random oracle model
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum security proofs using semi-classical oracles
• Random oracles in a quantum world
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• Succinct arguments in the quantum random oracle model
• The random oracle methodology, revisited.
• The random oracle model: a twenty-year retrospective
• Theory of Cryptography
• Theory of Cryptography

Cited in

(9)

• Non-uniformity and quantum advice in the quantum random oracle model
• Generalized hybrid search with applications to blockchains and hash function security
• Linkable ring signature scheme with stronger security guarantees
• Tight adaptive reprogramming in the QROM
• Classical vs quantum random oracles
• How to record quantum queries, and applications to quantum indifferentiability
• Quantum random oracle model with auxiliary input
• Random oracles in a quantum world
• Non-Observable Quantum Random Oracle Model

Describes a project that uses

Uses Software

• SPHINCS

This page was built for publication: A Note on the Instantiability of the Quantum Random Oracle

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