Pith. sign in

REVIEW 1 cited by

The Random Oracle Methodology, Revisited

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cs/0010019 v1 pith:MN2YODPX submitted 2000-10-11 cs.CR

Ran Canetti , Oded Goldreich , Shai Halevi This is my paper · ORCID
classification cs.CR
keywords oraclerandomschemescryptographicimplementationmodelresultsecurity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Computational Hardness of Mistake-Bounded Language Generation: A Random-Oracle Query Separation

    cs.CC 2026-08 accept novelty 7.0 of 10

    Under a random oracle, a countable family of infinite languages has closure dimension zero and admits zero-mistake unbounded generation, yet every polynomial-query generator incurs an exponential expected-mistake lowe...

Pith tools