Sciweavers

TCC
2012
Springer
227views Cryptology» more  TCC 2012»
12 years 11 days ago
Hardness Preserving Constructions of Pseudorandom Functions
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
Abhishek Jain, Krzysztof Pietrzak, Aris Tentes