Add to ORKGWe describe new ways of constructing pseudorandom generators for Boolean functions that satisfy certain bounds on their Fourier spectrum. We discuss the possibility of using this approach to construct pseudorandom generators for complexity classes that have eluded researches for decades. Based on joint works with Pooya Hatami, Kaave Hosseini, Shachar Lovett and Avishay Tal.Non UBCUnreviewedAuthor affiliation: Cornell University and IASPostdoctora
We study the complexity of building pseudorandom generators (PRGs) from hard functions. We show that...
We present a range of new results for testing properties of Boolean functions that are defined in te...
We study the Fourier spectrum of functions f : {0,1}^{mk} -> {-1,0,1} which can be written as a prod...
We describe new ways of constructing pseudorandom generators for Boolean functions that satisfy cert...
A recent work of Chattopadhyay et al. (CCC 2018) introduced a new framework for the design of pseudo...
This thesis focuses on applications of classical tools from probability theory and convex analysis s...
A fresh look at the question of randomness was taken in the theory of computing: A distribution is p...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
This dissertation involves the interplay between structure, randomness, and pseudorandomness in theo...
(Article begins on next page) The Harvard community has made this article openly available. Please s...
Pseudorandomness is the subfield of theoretical computer science which studies explicit construction...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...
We present a simple new construction of a pseudorandom bit generator, based on the constant depth ge...
Nisan and Wigderson in their seminal work introduced a new (conditional) pseudorandom generator cons...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
We study the complexity of building pseudorandom generators (PRGs) from hard functions. We show that...
We present a range of new results for testing properties of Boolean functions that are defined in te...
We study the Fourier spectrum of functions f : {0,1}^{mk} -> {-1,0,1} which can be written as a prod...
We describe new ways of constructing pseudorandom generators for Boolean functions that satisfy cert...
A recent work of Chattopadhyay et al. (CCC 2018) introduced a new framework for the design of pseudo...
This thesis focuses on applications of classical tools from probability theory and convex analysis s...
A fresh look at the question of randomness was taken in the theory of computing: A distribution is p...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
This dissertation involves the interplay between structure, randomness, and pseudorandomness in theo...
(Article begins on next page) The Harvard community has made this article openly available. Please s...
Pseudorandomness is the subfield of theoretical computer science which studies explicit construction...
A set F of n-ary Boolean functions is called a pseudorandom function generator (PRFG) if communicati...
We present a simple new construction of a pseudorandom bit generator, based on the constant depth ge...
Nisan and Wigderson in their seminal work introduced a new (conditional) pseudorandom generator cons...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
We study the complexity of building pseudorandom generators (PRGs) from hard functions. We show that...
We present a range of new results for testing properties of Boolean functions that are defined in te...
We study the Fourier spectrum of functions f : {0,1}^{mk} -> {-1,0,1} which can be written as a prod...