Editing Random oracle (section)

== Quantum-accessible random oracles ==
[[Post-quantum cryptography]] studies quantum attacks on classical cryptographic schemes. As a random oracle is an abstraction of a [[hash function]], it makes sense to assume that a quantum attacker can access the random oracle in [[quantum superposition]].<ref name="Bon11">{{cite conference
 | author = Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, and Mark Zhandry
 | title = Advances in Cryptology – ASIACRYPT 2011
 | chapter = Random oracles in a quantum world
 | series = Lecture Notes in Computer Science
 | year = 2011
 | volume = 7073
 | pages = 41–69
| publisher = Springer | doi = 10.1007/978-3-642-25385-0_3 | arxiv = 1008.0931| isbn = 978-3-642-25384-3
 }}</ref> Many of the classical security proofs break down in that quantum random oracle model and need to be revised.