ECCC
2011
12 years 11 months ago
2011
We revisit the notion of a targeted canonical derandomizer, introduced in our recent ECCC Report (TR10-135) as a uniform notion of a pseudorandom generator that suffices for yield...
ECCC
2010
13 years 4 months ago
2010
We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization r...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
We consider two of the most fundamental theorems in Cryptography. The first, due to H
STOC
1994
ACM
13 years 8 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain th...