Randomness extractors -- applications and constructions

Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for constructing extractors, these constructions turn out to have strong pseudorandom properties which found applications in diverse areas of computer science and combinatorics. We will highlight some of the applications, as well as recent constructions achieving near-optimal extraction.

[1]  Omer Reingold,et al.  Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .

[2]  Avi Wigderson,et al.  Extractors: optimal up to constant factors , 2003, STOC '03.

[3]  Piotr Indyk,et al.  Uncertainty principles, extractors, and explicit embeddings of l2 into l1 , 2007, STOC '07.

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

[5]  Salil P. Vadhan,et al.  Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model , 2003, Journal of Cryptology.

[6]  Avi Wigderson,et al.  Kakeya Sets, New Mergers and Old Extractors , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Avi Wigderson,et al.  Derandomization that is rarely wrong from short advice that is typically good , 2002, Electron. Colloquium Comput. Complex..

[8]  Madhu Sudan,et al.  Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[9]  Manuel Blum,et al.  Independent unbiased coin flips from a correlated biased source—A finite state markov chain , 1984, Comb..

[10]  Amnon Ta-Shma,et al.  Extractor codes , 2001, IEEE Transactions on Information Theory.

[11]  Miklos Santha,et al.  Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..

[12]  Avi Wigderson,et al.  Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.

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

[14]  Alexander Vardy,et al.  Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[15]  Zeev Dvir,et al.  On the size of Kakeya sets in finite fields , 2008, 0803.2336.

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

[17]  Avi Wigderson,et al.  Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1999, Comb..

[18]  Avi Wigderson,et al.  Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..

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

[20]  David Zuckerman Simulating BPP using a general weak random source , 2005, Algorithmica.

[21]  L. Fortnow Recent Developments in Explicit Constructions of Extractors , 2002 .

[22]  Vijay V. Vazirani,et al.  Random polynomial time is equal to slightly-random polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[23]  V. Vazirani,et al.  Random Polynomial Time is Equal to Semi-Random Polynomial Time , 1988 .