Pseudo-Random Generation from One-Way Functions

Pseudo-Random Generation from One-Way Functions (1988)

Cached

Download Links

by Johan Håstad , Russell Impagliazzo , Leonid A. Levin , Michael Luby

Venue:	PROC. 20TH STOC
Citations:	601 - 16 self

BibTeX

@INPROCEEDINGS{Håstad88pseudo-randomgeneration,
    author = {Johan Håstad and Russell Impagliazzo and Leonid A. Levin and Michael Luby},
    title = {Pseudo-Random Generation from One-Way Functions},
    booktitle = {PROC. 20TH STOC},
    year = {1988},
    pages = {12--24},
    publisher = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a one-way function from a pseudorandom generator, this result shows that there is a pseudorandom generator iff there is a one-way function.

Citations

4403	A mathematical theory of communication - Shannon - 1948
1567	Randomized Algorithms - Motwani, Raghavan - 1995
1001	Probabilistic encryption - Goldwasser, Micali - 1984
892	C.: The knowledge complexity of interactive proof-systems (extended abstract - Goldwasser, Micali, et al. - 1985
533	How to generate cryptographically strong sequences of pseudorandom bits - Blum, Micali - 1984
284	M.: Universal one-way hash functions and their cryptographic applications - Naor, Yung - 1989
244	How to construct pseudorandom permutations from pseudorandom functions - Luby, Rackoff - 1988
163	How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989
159	Unbiased bits from sources of weak randomness and probabilistic communication complexity - Chor, Goldreich - 1985
142	Public-Key Cryptosystem Based on Algebraic Coding Tehory - McEliece - 1978
136	A complexity theoretic approach to randomness - Sipser - 1983
117	One-way functions and pseudorandom generators - Levin - 1987
97	BPP has subexponential time simulations unless EXPTIME has publishable proofs - Babai, Fortnow, et al. - 1993
93	Seminumerical Algorithms. The Art of Computer Programming, Vol 2 - Knuth - 1969
71	Independent unbiased coin flips from a correlated biased source—a finite state Markov chain - Blum - 1986
69	Efficient cryptographic schemes provably as secure as subset sum - Impagliazzo, Naor - 1996
54	On the existence of pseudorandom generators - Goldreich, Krawczyk, et al. - 1993
49	Pseudorandom Generation under Uniform Assumptions - H˚astad - 1990
49	Random polynomial time is equal to slightly-random polynomial time - Vazirani, Vazirani - 1985
38	Bit Commitment using Pseudorandom Generators - Naor - 1991
35	One-way functions are essential for non-trivial zero-knowledge - Ostrovsky, Wigderson - 1993
34	One-way functions are necessary and su cient for secure signatures, STOC - Rompel - 1990
25	Why and how to establish a private code on a public network - Goldwasser, Micali, et al. - 1982
24	Pseudo-random number generation from one-way functions - Impagliazzo, Levin, et al. - 1989
23	Pseudo-random generators and complexity classes - Boppana, Hirschfeld - 1989
23	Inferring sequences produced by pseudo-random number generators - Boyar - 1989
22	Towards a strong communication complexity theory or generating quasirandom sequences from two communicating slightly-random sources (extended abstract - Vazirani - 1985
20	How to predict congruential generators - Krawczyk - 1992
19	Probability Theory (North-Holland - Renyi - 1970
1	A Note on Computational Indistinguishability", ICSI - Goldreich - 1989
1	A Hard-Core Predicate for any One-way Function", 21 rst ACM Symposium on Theory of Computing - Goldreich, Levin - 1989
1	Public Randomness in Cryptography", proceedings of CRYPTO 1992, ICSI technical report TR-92-068 - Herzberg, Luby - 1992
1	Randomness and Non-determinism", \One-way Function and Pseudorandom Generators - Levin - 1993