Not all uses of cryptographic hash functions require random oracles: schemes that require only one or more properties having a definition in the standard model (such as collision resistance, preimage resistance, second preimage resistance, etc.) can often be proven secure in the standard model (e.g., the Cramer-Shoup cryptosystem).
In 1993, Mihir Bellare and Phillip Rogaway[REF] were the first to advocate their use in cryptographic constructions.