While other cryptographic primitives are sometimes idealized, the ideal hash
function, the random oracle, is often considered too strong of a model. This
follows from the fact that there are several security properties related to
hash functions, where each researcher picks the ones that suit him or her
the best. In this talk, we will cover the various models, and the problems
that recent results have identified in the security of hash functions.