An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy

The breakthrough result of Chattopadhyay and Zuckerman (2016) gives a reduction from the construction of explicit two-source extractors to the construction of explicit non-malleable extractors. However, even assuming the existence of optimal explicit non-malleable extractors only gives a two-source extractor (or a Ramsey graph) for poly(logn) entropy, rather than the optimal O(logn). In this paper we modify the construction to solve the above barrier. Using the currently best explicit non-malleable extractors we get an explicit bipartite Ramsey graphs for sets of size 2k, for k=O(logn loglogn). Any further improvement in the construction of non-malleable extractors would immediately yield a corresponding two-source extractor. Intuitively, Chattopadhyay and Zuckerman use an extractor as a sampler, and we observe that one could use a weaker object - a somewhere-random condenser with a small entropy gap and a very short seed. We also show how to explicitly construct this weaker object using the error reduction technique of Raz, Reingold and Vadhan (1999), and the constant-degree dispersers of Zuckerman (2006) that also work against extremely small tests.

[1]  Guy Kindler,et al.  Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors , 2010, J. ACM.

[2]  Gil Cohen,et al.  Two-source dispersers for polylogarithmic entropy and improved ramsey graphs , 2015, Electron. Colloquium Comput. Complex..

[3]  Emanuele Viola,et al.  Extractors for Circuit Sources , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

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

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

[6]  Xin Li,et al.  Improved Constructions of Two-Source Extractors , 2015, Electron. Colloquium Comput. Complex..

[7]  Yevgeniy Dodis,et al.  Key Derivation without Entropy Waste , 2014, EUROCRYPT.

[8]  Gil Cohen,et al.  Making the Most of Advice: New Correlation Breakers and Their Applications , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

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

[10]  Ran Raz,et al.  Error reduction for extractors , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[11]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[12]  Xin Li,et al.  Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic Entropy , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[13]  Anup Rao,et al.  An Exposition of Bourgain's 2-Source Extractor , 2007, Electron. Colloquium Comput. Complex..

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

[15]  Parikshit Gopalan.  Constructing Ramsey graphs from Boolean function representations , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[16]  Vince Grolmusz.  Low Rank Co-Diagonal Matrices and Ramsey Graphs , 2000, Electron. J. Comb..

[17]  Gil Cohen,et al.  Two-Source Extractors for Quasi-Logarithmic Min-Entropy and Improved Privacy Amplification Protocols , 2016, Electron. Colloquium Comput. Complex..

[18]  Xin Li,et al.  Improved non-malleable extractors, non-malleable codes and independent source extractors , 2016, Electron. Colloquium Comput. Complex..

[19]  Raghu Meka,et al.  Explicit Resilient Functions Matching Ajtai-Linial , 2015, SODA.

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

[21]  Leonard J. Schulman,et al.  Extractors for Near Logarithmic Min-Entropy , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

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

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

[24]  Noga Alon,et al.  The Shannon Capacity of a Union , 1998, Comb..

[25]  Anup Rao.  Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources , 2009, SIAM J. Comput..

[26]  Xin Li,et al.  Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

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

[28]  M. Naor.  Constructing Ramsey graphs from small probability spaces , 1992 .

[29]  Boaz Barak.  A Simple Explicit Construction of an $n^{\Tilde{O}(\log n)}$-Ramsey Graph , 2006 .

[30]  Xin Li,et al.  Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[31]  H. L. Abbott,et al.  Lower Bounds for Some Ramsey Numbers , 1974, J. Comb. Theory, Ser. A.

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

[33]  P. Erdös.  Some remarks on the theory of graphs , 1947 .

[34]  Fan Chung Graham.  A note on constructive methods for ramsey numbers , 1981, J. Graph Theory.

[35]  Nathan Linial,et al.  The influence of large coalitions , 1993, Comb..

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

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

[38]  Noga Alon,et al.  Almost k-wise independence versus k-wise independence , 2003, Information Processing Letters.

[39]  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.

[40]  Peter Frankl,et al.  Intersection theorems with geometric consequences , 1981, Comb..

[41]  David Zuckerman,et al.  Explicit two-source extractors and resilient functions , 2016, Electron. Colloquium Comput. Complex..