The DOI matches its Crossref record.
A hard-core predicate for all one-way functions
Abstract
A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core” predicates b of functions (permutations) ƒ, discovered in [Blum Micali 82]. Such b(x) cannot be efficiently guessed (substantially better than 50-50) given only ƒ(x). Both b, ƒ are computable in polynomial time.
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
Lossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
Jerusalem lectures on black holes and quantum information
Harlow, D. (2016) · Reviews of Modern Physics · doi:10.1103/revmodphys.88.015002 · Cited by 480
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Kong, J., & Hong, X. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778449 · Cited by 432
Canetti, R., Dwork, C., Naor, M., & Ostrovsky, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052229 · Cited by 348
Extractors and pseudorandom generators
(2001) · Journal of the ACM · doi:10.1145/502090.502099 · Cited by 324
Metadata
- Authors
- Goldreich, O., & Levin, L. A.
- Venue
- Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89
- Publisher
- ACM Press
- Published
- 1989
- Pages
- 25-32
- OpenAlex
- W2027528470
- Cited by
- 1,193
- References
- 0
- FWCI
- 7.07
- 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: A hard-core predicate for all one-way functions. https://app.cochat.ai/papers/10.1145/73007.73010
- The paper
- Goldreich, O., & Levin, L. A. (1989). A hard-core predicate for all one-way functions. Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. https://doi.org/10.1145/73007.73010
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.
