Random Oracles in a Quantum World
Dan Boneh, \"Ozg\"ur Dagdelen, Marc Fischlin, Anja Lehmann, Christian, Schaffner, Mark Zhandry

TL;DR
This paper explores the security of cryptographic schemes in the quantum-accessible random oracle model, highlighting the importance of quantum considerations and proposing conditions under which classical proofs imply quantum security.
Contribution
It introduces the concept of history-free reductions and demonstrates their role in establishing post-quantum security for lattice-based cryptosystems.
Findings
Classical security does not imply quantum security in the random oracle model.
History-free reductions ensure security in the quantum-accessible random oracle model.
Certain lattice-based proposals are proven secure under these new conditions.
Abstract
The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and are proven secure relative to adversaries that have classical access to the random oracle. We argue that to prove post-quantum security one needs to prove security in the quantum-accessible random oracle model where the adversary can query the random oracle with quantum states. We begin by separating the classical and quantum-accessible random oracle models by presenting a scheme that is secure when the adversary is given classical access to the random oracle, but is insecure when the adversary can make quantum oracle queries. We then set out to develop generic conditions under which a classical random oracle proof implies security in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Cryptographic Implementations and Security · Complexity and Algorithms in Graphs
