The DOI matches its Crossref record.
The random oracle methodology, revisited (preliminary version)
Abstract
Article The random oracle methodology, revisited (preliminary version) Share on Authors: Ran Canetti IBM Watson, P.O. Box 704, Yorktown Heights, NY IBM Watson, P.O. Box 704, Yorktown Heights, NYView Profile , Oded Goldreich Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel Department of Computer Science, Weizmann Institute of Science, Rehovot, IsraelView Profile , Shai Halevi IBM Watson, P.O. Box 704, Yorktown Heights, NY IBM Watson, P.O. Box 704, Yorktown Heights, NYView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 209–218https://doi.org/10.1145/276698.276741Online:23 May 1998Publication History 403citation694DownloadsMetricsTotal Citations403Total Downloads694Last 12 Months14Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
A Survey of Homomorphic Encryption for Nonspecialists
Fontaine, C., & Galand, F. (2007) · EURASIP Journal on Information Security · doi:10.1155/2007/13801 · Cited by 438
On the Indifferentiability of the Sponge Construction
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_11 · Cited by 425
Micali, S. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795284959 · Cited by 424
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
Katz, J., Ostrovsky, R., & Yung, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_29 · Cited by 398
Metadata
- Authors
- Canetti, R., Goldreich, O., & Halevi, S.
- Venue
- Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
- Publisher
- ACM Press
- Published
- 1998
- Pages
- 209-218
- OpenAlex
- W2002930326
- Cited by
- 715
- References
- 0
- FWCI
- 19.06
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The random oracle methodology, revisited (preliminary version). https://app.cochat.ai/papers/10.1145/276698.276741
- The paper
- Canetti, R., Goldreich, O., & Halevi, S. (1998). The random oracle methodology, revisited (preliminary version). Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98. https://doi.org/10.1145/276698.276741
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
