Show simple item record

dc.contributor.authorCanetti, Ranen_US
dc.contributor.authorGoldreich, Odeden_US
dc.contributor.authorHalevi, Shaien_US
dc.date.accessioned2019-12-19T19:11:22Z
dc.date.available2019-12-19T19:11:22Z
dc.date.issued2004
dc.identifier.citationR. 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
dc.identifier.issn0004-5411
dc.identifier.urihttps://hdl.handle.net/2144/39024
dc.description.abstractWe 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 challengesen_US
dc.format.extentp. 557 - 594en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.ispartofJournal of the ACM
dc.subjectScience & technologyen_US
dc.subjectComputer science, hardware & architectureen_US
dc.subjectComputer science, information systemsen_US
dc.subjectComputer science, software engineeringen_US
dc.subjectComputer science, theory & methodsen_US
dc.subjectCorrelation intractabilityen_US
dc.subjectCryptographyen_US
dc.subjectDiagonalizationen_US
dc.subjectCS-proofsen_US
dc.subjectRandom-oracle modelen_US
dc.subjectSecurityen_US
dc.subjectTheoryen_US
dc.subjectProofsen_US
dc.subjectEncryptionen_US
dc.subjectSignaturesen_US
dc.subjectSignen_US
dc.subjectComputation theory & mathematicsen_US
dc.titleThe random oracle methodology, revisiteden_US
dc.typeArticleen_US
dc.description.versionAccepted manuscripten_US
dc.identifier.doi10.1145/1008731.1008734
pubs.elements-sourcemanual-entryen_US
pubs.notesEmbargo: No embargoen_US
pubs.organisational-groupBoston Universityen_US
pubs.organisational-groupBoston University, College of Arts & Sciencesen_US
pubs.organisational-groupBoston University, College of Arts & Sciences, Department of Computer Scienceen_US
pubs.publication-statusPublisheden_US
dc.identifier.mycv58017


This item appears in the following Collection(s)

Show simple item record