The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Pseudo-random generation from one-way functions
Open accessAbstract
We show that the existence of one-way functions is necessary and sufficient for the existence of pseudo-random generators in the following sense. Let ƒ be an easily computable function such that when x is chosen randomly: (1) from ƒ(x) it is hard to recover an x1 with ƒ(x1) = ƒ(x) by a small circuit, or; (2) ƒ has small degeneracy and from ƒ(x) it is hard to recover x by a fast algorithm. From one-way functions of type (1) or (2) we show how to construct pseudo-random generators secure against small circuits or fast algorithms, respectively, and vice-versa. Previous results show how to construct pseudo-random generators from one-way functions that have special properties ([Blum, Micali 82], [Yao 82], [Levin 85], [Goldreich, Krawczyk, Luby 88]).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
The knowledge complexity of interactive proof systems
Goldwasser, S., Micali, S., & Rackoff, C. (1989) · SIAM Journal on Computing · doi:10.1137/0218012 · Cited by 3,285
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
A hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
Self-citationTheory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Universal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73011 · Cited by 959
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
Self-citationLimits on the provable consequences of one-way permutations
Impagliazzo, R., & Rudich, S. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73012 · Cited by 575
Self-citationProofs that yield nothing but their validity and a methodology of cryptographic protocol design
Goldreich, O., Micali, S., & Wigderson, A. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.47 · Cited by 549
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
Chor, B., & Goldreich, O. (1988) · SIAM Journal on Computing · doi:10.1137/0217015 · Cited by 544
One-way functions are essential for complexity based cryptography
Impagliazzo, R., & Luby, M. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63483 · Cited by 339
Self-citationOne way functions and pseudorandom generators
Levin, L. A. (1987) · Combinatorica · doi:10.1007/bf02579323 · Cited by 257
Self-citationGenerating quasi-random sequences from semi-random sources
Santha, M., & Vazirani, U. V. (1986) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(86)90044-9 · Cited by 256
How to generate cryptographically strong sequences of pseudo random bits
Blum, M., & Micali, S. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.72 · Cited by 252
Independent unbiased coin flips from a correlated biased source—A finite state markov chain
Blum, M. (1986) · COMBINATORICA · doi:10.1007/bf02579167 · Cited by 139
How to Construct Pseudo-random Permutations from Pseudo-random Functions
Luby, M. G., & Rackoff, C. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_34 · Cited by 133
Self-citationRandom polynomial time is equal to slightly-random polynomial time
Vazirani, U. V., & Vazirani, V. V. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.45 · Cited by 113
Generating Quasi-Random Sequences From Slightly-Random Sources
Sántha, M., & Vazirani, U. V. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1984.715945 · Cited by 106
Unbiased bits from sources of weak randomness and probabilistic communication complexity
Chor, B., & Goldreich, O. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.62 · Cited by 102
Vazirani, U. V. (1987) · COMBINATORICA · doi:10.1007/bf02579325 · Cited by 98
On the existence of pseudorandom generators
Goldreich, O., Krawczyk, H., & Luby, M. G. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21917 · Cited by 63
Self-citationIndependent Unbiased Coin Flips From A Correlated Biased Source: A Finite State Markov Chain
Blum, M. (2005) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1984.715944 · Cited by 53
Vazirani, U. V. (1985) · doi:10.1145/22145.22186 · Cited by 49
How to generate cryptographically strong sequences of pseudo random bits
Blum, M., & Micali, S. (2019) · ACM eBooks · doi:10.1145/3335741.3335751 · Cited by 24
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Reyzin, L., & Smith, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_31 · Cited by 2,038
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Ostrovsky, R., Reyzin, L., & Smith, A. (2008) · SIAM Journal on Computing · doi:10.1137/060651380 · Cited by 1,717
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
Self-citation
Metadata
- Authors
- Impagliazzo, R., Levin, L. A., & Luby, M.
- Venue
- Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89
- Publisher
- ACM Press
- Published
- 1989
- Pages
- 12-24
- OpenAlex
- W2064423787
- Cited by
- 724
- References
- 28
- FWCI
- 15.37
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
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.