Simulating independence
- 1 April 2010
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 57 (4) , 1-52
- https://doi.org/10.1145/1734213.1734214
Abstract
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a δ-source if X assigns probability at most 2−δn to any string of length n. For every δ>0, we construct the following poly(n)-time computable functions: 2-source disperser: D:({0, 1}n)2 → {0, 1} such that for any two independent δ-sources X1,X2 we have that the support of D(X1,X2) is {0, 1}. Bipartite Ramsey graph: Let N=2n. A corollary is that the function D is a 2-coloring of the edges of KN,N (the complete bipartite graph over two sets of N vertices) such that any induced subgraph of size Nδ by Nδ is not monochromatic. 3-source extractor: E:({0, 1}n)3→ {0, 1} such that for any three independent δ-sources X1,X2,X3 we have that E(X1,X2,X3) is o(1)-close to being an unbiased random bit. No previous explicit construction was known for either of these for any δC:{0, 1}n → ({0, 1}n/c)d (where c and d are constants that depend only on δ) such that for every δ-source X one of the output blocks of C(X) is (exponentially close to) a 0.9-source. (This result was obtained independently by Ran Raz.) The constructions are quite involved and use as building blocks other new and known objects. A recurring theme in these constructions is that objects that were designed to work with independent inputs, sometimes perform well enough with correlated, high entropy inputs. The construction of the disperser is based on a new technique which we call “the challenge-response mechanism” that (in some sense) allows “identifying high entropy regions” in a given pair of sources using only one sample from the two sources.Keywords
Funding Information
- Division of Computing and Communication Foundations (CNS-0627526CCF-0426582CCF-0832797)
- Israel Science Foundation (686/07)
- Division of Computer and Network Systems (CNS-0627526CCF-0426582CCF-0832797)
- Division of Mathematical Sciences (DMS-0812005)
- United States-Israel Binational Science Foundation (2.00E+13)
This publication has 27 references indexed in Scilit:
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codesJournal of the ACM, 2009
- Lossless Condensers, Unbalanced Expanders, And ExtractorsCombinatorica, 2007
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient CryptographySIAM Journal on Computing, 2007
- Extracting Randomness Using Few Independent SourcesSIAM Journal on Computing, 2006
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent SeedSIAM Journal on Computing, 2006
- Extracting Randomness via Repeated CondensingSIAM Journal on Computing, 2006
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONSInternational Journal of Number Theory, 2005
- On the complexity of approximating the VC dimensionJournal of Computer and System Sciences, 2002
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication ComplexitySIAM Journal on Computing, 1988
- Independent unbiased coin flips from a correlated biased source—A finite state markov chainCombinatorica, 1986