Revision as of 10:12, 24 October 2020 edit Citation bot (talk \| contribs) Bots 5,866,811 edits Alter: template type, pages. Add: s2cid, doi, journal, author pars. 1-1. Removed parameters. Formatted dashes. Some additions/deletions were actually parameter name changes. \| You can use this bot yourself. Report bugs here. \| Suggested by AManWithNoPlan \| All pages linked from cached copy of User:AManWithNoPlan/sandbox3 \| via #UCB_webform_linked 881/2623 ← Previous edit		Revision as of 16:09, 3 January 2021 edit undo Sugarfrosted (talk \| contribs) 48 edits No edit summary Next edit →
Line 5: Stated differently, a random oracle is a [[mathematical function]] chosen uniformly at random, that is, a function mapping each possible query to a (fixed) random response from its output ___domain. Random oracles as a mathematical abstraction were ~~firstly~~first used in rigorous cryptographic proofs in the 1993 publication by [[Mihir Bellare]] and [[Phillip Rogaway]] (1993).<ref name="bellrog">{{cite journal\|first1=Mihir\|last1=Bellare\|authorlink=Mihir Bellare\|first2=Phillip\|last2=Rogaway\|authorlink2=Phillip Rogaway\|title=Random Oracles are Practical: A Paradigm for Designing Efficient Protocols\|journal=ACM Conference on Computer and Communications Security\|year=1993\|pages=62–73\|url=http://www.cs.ucsd.edu/users/mihir/papers/ro.html}}</ref> They are typically used when the proof cannot be carried out using weaker assumptions on the [[cryptographic hash function]]. A system that is proven secure when every hash function is replaced by a random oracle is described as being secure in the '''random oracle model''', as opposed to secure in the [[Standard Model (cryptography)\|standard model of cryptography]]. == Applications ==

Random oracle: Difference between revisions