Live briefing
Everything about Random oracle
Cryptographic model of a random function
In cryptography, a random oracle is an oracle that responds to every unique query with a (truly) random response chosen uniformly from its output domain. If a query is repeated, it responds the same way every time that query is submitted. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Random oracleA 5-minute orientation
- Skim a recent paper: Secure and Efficient Certificateless Searchable Authenticated Encryption Scheme Without Random Oracle for Industrial Internet of ThingsInfluential work since 2022
- Pick up a classic book: The DivinersThe most-reprinted book on the subject
- Read the landmark paper: The random oracle methodology, revisitedCited 672 times
- Go sideways: Pseudorandom permutationA closely related topic
- Go sideways: Standard model (cryptography)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
The random oracle methodology, revisited
Classifier Ensembles with a Random Linear Oracle
The random oracle model: a twenty-year retrospective
Thwarting All Logic Locking Attacks: Dishonest Oracle With Truly Random Logic Locking
Effects of a random noisy oracle on search algorithm complexity
On the random oracle hypothesis
The random oracle hypothesis is false
Secure identity-based encryption in the quantum random oracle model
🆕 Influential since 2022
Secure and Efficient Certificateless Searchable Authenticated Encryption Scheme Without Random Oracle for Industrial Internet of Things
Random Access Protocol With Channel Oracle Enabled by a Reconfigurable Intelligent Surface
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model
A constant-size lattice-based partially-dynamic group signature scheme in quantum random oracle model
Fiat–Shamir Bulletproofs are Non-malleable (in the Random Oracle Model)
📚 Books worth reading
The DivinersMargaret Laurence · 1974
Mallory's oracleCarol O'Connell · 1994
The Prophet of Yonwood (Book of Ember #3)Jeanne DuPrau · 2006
The Black Bird OracleDeborah Harkness · 2024
The KiTakashi Yoshikawa · 1986
The oracle at Stoneleigh CourtPeter Hillsman Taylor · 1993
The Light of the Oracle (Healer and Seer #3)Victoria Hanley · 2005
Oracle's QueenLynn Flewelling · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Pseudorandom permutation In cryptography, a pseudorandom permutation (PRP) is a function that cannot be distinguished from a random permutation (that is, a permutation selected…
- Standard model (cryptography) In cryptography the standard model is the model of computation in which the adversary is only limited by the amount of time and computational power available…
- Block cipher In cryptography, a block cipher is a deterministic algorithm that operates on fixed-length groups of bits, called blocks. Block ciphers are the elementary…
- Provable security Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields. Usually, this…
- Domain separation In cryptography, domain separation is a construct used to implement multiple different functions using only one underlying template in an efficient way…
- One-way function Unsolved problem in computer science Do one-way functions exist? More unsolved problems in computer science In computer science, a one-way function is…
- Mihir Bellare Mihir Bellare is a cryptographer and professor at the University of California San Diego. He holds a Bachelor of Science degree from the California Institute…
- Chosen-ciphertext attack A chosen-ciphertext attack (CCA) is an attack model for cryptanalysis in which the cryptanalyst can gather information by obtaining the decryptions of…