Sciweavers

24 search results - page 1 / 5
» Hardness Preserving Constructions of Pseudorandom Functions
Sort
View
TCC
2012
Springer
227views Cryptology» more  TCC 2012»
13 years 5 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
CC
2005
Springer
118views System Software» more  CC 2005»
14 years 10 months ago
The complexity of constructing pseudorandom generators from hard functions
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
Emanuele Viola
CRYPTO
1998
Springer
137views Cryptology» more  CRYPTO 1998»
15 years 2 months ago
Building PRFs from PRPs
Abstract. We evaluate constructions for building pseudo-random functions (PRFs) from pseudo-random permutations (PRPs). We present two constructions: a slower construction which pr...
Chris Hall, David Wagner, John Kelsey, Bruce Schne...
FOCS
1999
IEEE
15 years 2 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
ICALP
2005
Springer
15 years 3 months ago
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
Marius Zimand