Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions

@inproceedings{Haitner2006EfficientPG,
  title={Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions},
  author={Iftach Haitner and Danny Harnik and Omer Reingold},
  booktitle={ICALP},
  year={2006}
}
In their seminal paper [HILL99], H̊astad, 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… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…