Random oracle: Difference between revisions

Content deleted Content added
Monkbot (talk | contribs)
m Task 18 (cosmetic): eval 13 templates: hyphenate params (5×);
Yobot (talk | contribs)
m Quantum-accessible Random Oracles: Fix REFPUNCT + other minor fixes
Line 37:
 
== 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=Bon+11>{{cite conference
| author = Dan Boneh, Özgür Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, and Mark Zhandry
| title = Random oracles in a quantum world
| year = 2011
| pages = 41–69
| publisher = Springer | doi = 10.1007/978-3-642-25385-0_3 | arxiv = 1008.0931}}</ref>. Many of the classical security proofs break down in that quantum random oracle model and need to be revised.
 
== See also ==