The random oracle methodology, revisited
MetadataShow full item record
Citation (published version)R. Canetti, O. Goldreich, S. Halevi. 2004. "The random oracle methodology, revisited." Journal of the ACM, Volume 51, Issue 4, pp. 557 - 594. https://doi.org/10.1145/1008731.1008734
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 paper 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
Showing items related by title, author, creator and subject.
Granger, Brian R.; Chang, Yi-Chien; Wang, Yan; DeLisi, Charles; Segre, Daniel; Hu, Zhenjun (PUBLIC LIBRARY SCIENCE, 2016-04-01)The complexity of metabolic networks in microbial communities poses an unresolved visualization and interpretation challenge. We address this challenge in the newly expanded version of a software tool for the analysis of ...
Cannon, Jonathan; Kopell, Nancy; Gardner, Timothy; Markowitz, Jeffrey (PUBLIC LIBRARY SCIENCE, 2015-11-01)Stereotyped sequences of neural activity are thought to underlie reproducible behaviors and cognitive processes ranging from memory recall to arm movement. One of the most prominent theoretical models of neural sequence ...
Papagiannopoulou, Dimitra; Capodanno, Giuseppe; Moreshet, Tali; Herlihy, Maurice; Bahar, R Iris (ASSOC COMPUTING MACHINERY, 2015-05-01)Embedded systems are becoming increasingly common in everyday life and like their general-purpose counterparts, they have shifted towards shared memory multicore architectures. However, they are much more resource constrained, ...