Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy

We study the problem of constructing explicit extractors for independent general weak random sources. Given weak sources on n bits, the probabilistic method shows that there exists a deterministic extractor for two independent sources with min-entropy as small as log n+O(1). However, even to extract from a constant number of independent sources, previously the best known extractors require the min-entropy to be at least nδ for any constant δ > 0 [1], [2], [3]. For sources on n bits with min-entropy k ≥ polylog(n), previously the best known extractor needs to use O(log(log n/log k))+O(1) independent sources Li12d. In this paper, we construct the first explicit extractor for a constant number of independent sources on n bits with min-entropy k ≥ polylog(n). Thus, for the first time we get extractors for independent sources that are close to optimal. Our extractor is obtained by improving the condenser for structured somewhere random sources in [3], which is based on a connection between the problem of condensing somewhere random sources and the problem of leader election in distributed computing.

[1]  Amit Sahai,et al.  On the (im)possibility of cryptography with imperfect randomness , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[2]  Yevgeniy Dodis,et al.  Non-malleable extractors and symmetric key cryptography from weak secrets , 2009, STOC '09.

[3]  Avi Wigderson,et al.  Extracting randomness using few independent sources , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[4]  Ueli Maurer,et al.  Privacy Amplification Secure Against Active Adversaries , 1997, CRYPTO.

[5]  J. Bourgain,et al.  MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS , 2005 .

[6]  Xin Li,et al.  New independent source extractors with exponential improvement , 2013, STOC '13.

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

[8]  Avi Wigderson,et al.  2-source dispersers for $n^{o(1)}$ entropy, and Ramsey graphs beating the Frankl-Wilson construction , 2012 .

[9]  Ran Raz,et al.  Extractors with weak random seeds , 2005, STOC '05.

[10]  Uriel Feige,et al.  Noncryptographic selection protocols , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[11]  Xin Li,et al.  Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification , 2012, TCC.

[12]  Anup Rao,et al.  Extractors for a constant number of polynomially small min-entropy independent sources , 2006, STOC '06.

[13]  Yael Tauman Kalai,et al.  2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

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

[15]  Rafail Ostrovsky,et al.  Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..

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

[17]  Guy Kindler,et al.  Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors , 2005, STOC '05.

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

[19]  Yael Tauman Kalai,et al.  Network Extractor Protocols , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[20]  Avi Wigderson,et al.  2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction , 2006, STOC '06.

[21]  Xin Li,et al.  Improved Constructions of Three Source Extractors , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

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

[23]  Xin Li,et al.  Non-malleable Extractors, Two-Source Extractors and Privacy Amplification , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[24]  Mihir Bellare,et al.  Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.