The random oracle methodology, revisited

R Canetti, O Goldreich, S Halevi - Journal of the ACM (JACM), 2004 - dl.acm.org
Journal of the ACM (JACM), 2004dl.acm.org
We take a critical look at the relationship between the security of cryptographic schemes in
the Random Oracle Model, and the security of the schemes that result from implementing the
random oracle by so called" cryptographic hash functions". The main result of this article is a
negative one: There exist signature and encryption schemes that are secure in the Random
Oracle Model, but for which any implementation of the random oracle results in insecure
schemes. In the process of devising the above schemes, we consider possible definitions for …
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions".The main result of this article is a negative one: There exist signature and encryption schemes that are secure in the Random Oracle Model, but for which any implementation of the random oracle results in insecure schemes. In the process of devising the above schemes, we consider possible definitions for the notion of a "good implementation" of a random oracle, pointing out limitations and challenges.
ACM Digital Library