Efficient pseudorandom generators from exponentially hard one-way functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4052 LNCS, Issue , 2006, Pages 228-239

  Haitner, Iftach ^a   Harnik, Danny ^b   Reingold, Omer ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; RANDOM PROCESSES; SECURITY OF DATA;

PLAUSIBILITY; PSEUDORANDOM GENERATORS; SECURITY DETERIORATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33746342808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_20     Document Type: Conference Paper

References (14)

1. [BM82] M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo random bits. In 23th Annual FOCS, pages 112-117, 1982.
2. [CW77] I. Carter and M. Wegman. Universal classes of hash functions. In 9th ACM STOC, pages 106-112, 1977.
3. [GGM86] O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(2):792-807, 1986.
4. [GKL93] O. Goldreich, H. Krawczyk, and M. Luby. On the existence of pseudorandom generators. SIAM Journal of Computing, 22(6):1163-1175, 1993.
5. [GL89] O. Goldreich and L.A. Levin. A hard-core predicate for all one-way functions. In 21st ACM STOC, pages 25-32, 1989.
6. [HHR05] I. Haitner, D. Harnik, and O. Reingold. On the power of the randomized iterate. ECCC, TR05-135, 2005.
7. [HILL99] J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal of Computing, 29(4): 1364-1396, 1999.
8. [Hol05] T. Holenstein. Key agreement from weak bit agreement. In Proceedings of the 37th ACM STOC, pages 664-673, 2005.
9. [Hol06] Thomas Holenstein. Pseudorandom generators from one-way functions: A simple construction for any hardness. In 3rd Theory of Cryptography Conference - (TCC '06), LNCS. Springer-Verlag, 2006.
10. [ILL89] R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. In 21st ACM STOC, pages 12-24, 1989.
11. [Lev87] L. A. Levin. One-way functions and pseudorandom generators. Combinatorics 7:357-363, 1987.
12. [LR88] M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing, 17(2): 373-386, 1988.
13. [Nao91] M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.
14. [Yao82] A. C. Yao. Theory and application of trapdoor functions. In 23rd IEEE FOCS, pages 80-91, 1982.