Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions

  • Iftach Haitner
  • Danny Harnik
  • Omer Reingold
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4052)

Abstract

In their seminal paper [HILL99], Håstad, Impagliazzo, Levin and Luby show that a pseudorandom generator can be constructed from any one-way function. This plausibility result is one of the most fundamental theorems in cryptography and helps shape our understanding of hardness and randomness in the field. Unfortunately, the reduction of [HILL99] is not nearly as efficient nor as security preserving as one may desire. The main reason for the security deterioration is the blowup to the size of the input. In particular, given one-way functions on n bits one obtains by [HILL99] pseudorandom generators with seed length \(\cal{O}\)(n8). Alternative constructions that are far more efficient exist when assuming the one-way function is of a certain restricted structure (e.g. a permutations or a regular function). Recently, Holenstein [Hol06] addressed a different type of restriction. It is demonstrated in [Hol06] that the blowup in the construction may be reduced when considering one-way functions that have exponential hardness. This result generalizes the original construction of [HILL99] and obtains a generator from any exponentially hard one-way function with a blowup of \(\cal{O}\)(n5), and even \(\cal{O}\)(n4 log2n) if the security of the resulting pseudorandom generator is allowed to have weaker (yet super-polynomial) security.

In this work we show a construction of a pseudorandom generator from any exponentially hard one-way function with a blowup of only \(\cal{O}\)(n2) and respectively, only \(\cal{O}\)(n log2n) if the security of the resulting pseudorandom generator is allowed to have only super-polynomial security. Our technique does not take the path of the original [HILL99] methodology, but rather follows by using the tools recently presented in [HHR05] (for the setting of regular one-way functions) and further developing them.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Iftach Haitner
    • 1
  • Danny Harnik
    • 2
  • Omer Reingold
    • 1
  1. 1.Dept. of Computer Science and Applied Math.Weizmann Institute of ScienceRehovotIsrael
  2. 2.Dept. of Computer ScienceTechnionHaifaIsrael

Personalised recommendations