Sciweavers

81
Voted
TCC
2012
Springer
227views Cryptology» more  TCC 2012»
13 years 4 months 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