Theory of Pseudorandomness

Pseudorandomness is the theory of eciently generating objects that \look random" despite being constructed with little or no randomness. One of the achievements of this research area has been the realization that a number of fundamental and widely studied \pseudorandom" objects are all almost equivalent when viewed appropriately. These objects include pseudorandom generators, expander graphs, list-decodable error- correcting codes, averaging samplers, and hardness ampliers. In this survey, we describe the connections between all of these objects, showing how they can all be cast within a single \list-decoding framework" that brings out both their similarities and dierences.

[1]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  Andrew Chi-Chih Yao,et al.  Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

[3]  N. Alon.  Eigenvalues and expanders , 1986, Comb..

[4]  Oded Goldreich,et al.  Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..

[5]  Oded Goldreich,et al.  On the power of two-point based sampling , 1989, J. Complex..

[6]  Noam Nisan,et al.  BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[7]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[8]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[9]  Oded Goldreich,et al.  A Sample of Samplers - A Computational Perspective on Sampling (survey) , 1997, Electron. Colloquium Comput. Complex..

[10]  David Zuckerman,et al.  Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.

[11]  D. Gillman.  A Chernoff bound for random walks on expander graphs , 1998, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  José D. P. Rolim,et al.  Recent Advances Towards Proving P = BPP , 1998, Bull. EATCS.

[13]  Luca Trevisan,et al.  Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[14]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[15]  Noam Nisan,et al.  Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..

[16]  Jaikumar Radhakrishnan,et al.  Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators , 2000, SIAM J. Discret. Math..

[17]  Madhu Sudan.  List decoding: algorithms and applications , 2000, SIGA.

[18]  Amnon Ta-Shma,et al.  Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.

[19]  Luca Trevisan,et al.  Extractors and pseudorandom generators , 2001, JACM.

[20]  Valentine Kabanets,et al.  2 Better Tradeoffs 2 . 1 Hardness amplification via error-correcting codes , 2007 .

[21]  Amnon Ta-Shma,et al.  Extractor codes , 2004, IEEE Trans. Inf. Theory.

[22]  Luca Trevisan,et al.  Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..

[23]  Venkatesan Guruswami,et al.  Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..

[24]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[25]  Luca Trevisan,et al.  Pseudorandomness and Combinatorial Constructions , 2006, Electron. Colloquium Comput. Complex..

[26]  Prasad Tetali,et al.  Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs , 2006 .

[27]  Luca Trevisan,et al.  Pseudorandomness and Average-Case Complexity Via Uniform Reductions , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[28]  Oded Goldreich,et al.  Computational complexity: a conceptual perspective , 2008, SIGA.

[29]  Enkatesan G Uruswami.  Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes , 2008 .