Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors

Journal of the ACM

Volumn 57, Issue 4, 2010, Pages

  Barak, B ^a   Kindler, G ^b   Shaltiel, R ^c   Sudakov, B ^d   Wigderson, A ^e  

^a PRINCETON UNIVERSITY   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c UNIVERSITY OF HAIFA   (Israel)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Condensers; Dispersers; Explicit constructions; Extractors; Ramsey graphs

Indexed keywords

BINARY STRING; BUILDING BLOCKES; CHALLENGE RESPONSE; COMPLETE BIPARTITE GRAPHS; COMPUTABLE FUNCTIONS; EXPLICIT CONSTRUCTIONS; INDUCED SUBGRAPHS; NEW CONSTRUCTION; OPEN PROBLEMS; RANDOMNESS EXTRACTORS; SOURCE EXTRACTOR; TWO SOURCES;

PROBABILITY DISTRIBUTIONS;

GRAPH THEORY;

EID: 77952022169     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1734213.1734214     Document Type: Article

References (40)

1. BARAK, B., IMPAGLIAZZO, R., AND WIGDERSON, A. 2006a. Extracting randomness using few independent sources. SIAM J. Comput 36, 4, 1095-1118. (Preliminary version in FOCS '04).
2. BARAK, B.,RAO, A., SHALTIEL, R., ANDWIGDERSON, A. 2006b. 2-source dispersers for sub-polynomial entropy and ramsey graphs beating the Frankl-Wilson construction. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. 671-680.
3. BARAK, B., SHALTIEL, R., AND TROMER, E. 2003. True random number generators secure in a changing environment. In Proceedings of the Workshop on Cryptographic Hardware and Embedded Systems (CHES). Lecture Notes in Computer Science, vol. 2779. Springer-Verlag, Berlin, Germany. 166-180.
4. BENOR,M. AND LINIAL,N. 1989. Collective coin flipping. ADVCR: Advances in Computing Research 5.
5. BLUM,M. 1986. Independent unbiased coin flips from a correlated biased source-A finite state markov chain. Combinatorica 6, 2, 97-108.
6. BOURGAIN, J. 2005. More on the sum-product phenomenon in prime fields and its applications. Int. J. Numb. Theory 1, 1-32.
7. BOURGAIN, J., KATZ, N., AND TAO, T. 2004. A sum-product estimate in finite fields, and applications. Geom. Funct. Anal. 14, 1, 27-57.
8. CAPALBO, M., REINGOLD, O., VADHAN, S., AND WIGDERSON, A. 2002. Randomness conductors and constant-degree lossless expanders. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, 659-668. (Pubitemid 35009428)
9. CHOR, B., AND GOLDREICH, O. 1988. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17, 2, 230-261.
10. CHOR, B., GOLDREICH, O., HASTAD, J., FRIEDMAN, J., RUDICH, S., AND SMOLENSKY, R. 1985. The bit extraction problem of t-resilient functions (preliminary version). In Proceedings of the 26th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 396-407.
11. COHEN, A., AND WIGDERSON, A. 1989. Dispersers, deterministic amplification, and weak random sources. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 14-19.
12. DODIS, Y., ELBAZ, A., OLIVEIRA, R., AND RAZ, R. 2004. Improved randomness extraction from two independent sources. In Proc. of 8th International Workshop on Randomization.
13. DODIS, Y., AND SPENCER, J. 2002. On the (non)universality of the one-time pad. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 376-388.
14. FRANKL, P., AND WILSON, R. M. 1981. Intersection theorems with geometric consequences. Combinatorica 1, 4, 357-368.
15. GABIZON, A., RAZ, R., AND SHALTIEL, R. 2006. Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM J. Comput. 36, 4, 1072-1094. (Preliminary version in FOCS '04).
16. GABIZON, A., AND SHALTIEL, R. 2008. Increasing the output length of zero-error dispersers. In Proceedings of the APPROX-RANDOM. Lecture Notes in Computer Science, vol. 5171. Springer-Verlag, Berlin, Germany, 430-443.
17. GOLDREICH, O. 1995. Three xor-lemmas- An exposition. ECCC Report TR95-056.
18. GURUSWAMI, V.,UMANS, C., AND VADHAN, S. 2009. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. J. ACM 56, 4, 20. (Preliminary version in CCC '07).
19. KAMP, J., AND ZUCKERMAN, D. 2007. Deterministic extractors for bit-fixing sources and exposureresilient cryptography. SIAM J. Comput. 36, 5, 1231-1247. (Preliminary version in STOC '06).
20. KATZ, N., AND SHEN, C. 2009. Garaev's inequality in finite fields not of prime order. Preprint, Arxiv:math/0703676.
21. LU, C.-J., REINGOLD, O., VADHAN, S., AND WIGDERSON, A. 2003. Extractors: optimal up to constant factors. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, 602-611.
22. MCINNES, J. L., AND PINKAS, B. 1990. On the impossibility of private key cryptography with weakly random keys. In Proceedings of Crypto '90. Lecture Notes in Computer Science, vol. 537. Springer- Verlag, Berlin, Germany, 421-436.
23. MOSSEL, E., AND UMANS, C. 2002. On the complexity of approximating the VC dimension. J. Comput. Syst. Sci. 65, 4, 660-671. (Preliminary version in CCC '01). (Pubitemid 41161944)
24. PUDLAK, P. 2006. On explicit ramsey graphs and estimates on the numbers of sums and products. In Topics in Discrete Mathematics, Algorithms Combin. Vol. 26. Springer-Verlag, Berlin, Germany, 169-175.
25. PUDĹAK, P., AND RÖDL, V. 2004. Pseudorandom sets and explicit constructions of ramsey graphs. In Complexity of Computations and Proofs. Quad. Mat., 13, Dept. Math., Seconda Univ. Napoli, Caserta, 327-346.
26. RAO,A. 2006. Extractors for a constant number of polynomially small min-entropy independent sources. In Proceedings of the 38th Annual ACMSymposium on Theory of Computing.ACM,NewYork, 497-506.
27. RAZ, R. 2005. Extractors with weak random seeds. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing. ACM, New York, 11-20.
28. RAZ, R., AND REINGOLD, O. 1999. On recycling the randomness of states in space bounded computation. In Proceedings of the 31st Annual ACMSymposium on Theory of Computing. ACM, New York, 159-168.
29. REINGOLD, O., SHALTIEL, R., ANDWIGDERSON, A. 2006. Extracting randomness via repeated condensing. SIAM J. Comput. 35, 5, 1185-1209. (Preliminary version in FOCS '00).
30. REINGOLD, O., VADHAN, S. P., AND WIGDERSON, A. 2002. Entropy waves, the zig-zag graph product, and new constant-degree expanders. Ann. Math. 155, 1, 157-187. (Preliminary vesion in FOCS '00).
31. SANTHA, M., AND VAZIRANI, U. V. 1984. Generating quasi-random sequences from slightly-random sources. In Proceedings of the 25th Symposium on the Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 434-440. (Pubitemid 16526277)
32. SHALTIEL, R. 2002. Recent developments in extractors. Bulletin of the European Association for Theoretical Computer Science.
33. TA-SHMA, A. 1996. On extracting randomness from weak random sources. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, 276-285.
34. TA-SHMA, A.,UMANS, C., AND ZUCKERMAN, D. 2007. Lossless condensers, unbalanced expanders, and extractors. Combinatorica 27, 2, 213-240.
35. TAO, T. AND VU, V. 2006. Additive combinatorics. Cambridge University Press, Cambridge, MA.
36. TREVISAN, L., AND VADHAN, S. 2000. Extracting randomness from samplable distributions. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 32-42.
37. VAZIRANI, U. 1987. Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources. Combinatorica 7, 4.
38. VONNEUMANN, J. 1951. Various techniques used in connectionwith random digits. Appl.Math Series 12, 36-38.
39. ZUCKERMAN, D. 1990. General weak random sources. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 534-543.
40. ZUCKERMAN, D. 2007. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3, 1, 103-128. (Preliminary version in STOC '06).