A new approach to affine extractors and dispersers

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2011, Pages 137-147

  Li, Xin ^a  

^a University of Texas at Austin   (United States)

Author keywords

Affine; Disperser; Extractor; Randomness

Indexed keywords

AFFINE; BASIC PROPERTIES; DISPERSER; EXTRACTOR; LINEAR ENTROPY; RANDOMNESS;

ENTROPY; MACHINERY;

COMPUTATIONAL COMPLEXITY;

EID: 80052008588     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2011.27     Document Type: Conference Paper

References (27)

1. L. Fortnow and R. Shaltiel, "Recent developments in explicit constructions of extractors," 2002.
2. L. Trevisan and S. Vadhan, "Extracting randomness from samplable distributions," in Proc. of 41st FOCS, 2000.
3. J. Kamp and D. Zuckerman, "Deterministic extractors for bit-fixing sources and exposure-resilient cryptography," SIAM Journal on Computing, vol. 36, no. 5, 2007.
4. A. Gabizon, R. Raz, and R. Shaltiel, "Deterministic extractors for bit-fixing sources by obtaining an independent seed," in Proc. of 45th FOCS, 2004.
5. B. Barak, R. Impagliazzo, and A. Wigderson, "Extracting randomness using few independent sources," in Proc. of 45th FOCS, 2004, pp. 384-393. (Pubitemid 40575300)
6. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson, "Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors," in Proc. of 37th STOC, 2005, pp. 1-10. (Pubitemid 43098566)
7. A. Rao, "Extractors for a constant number of polynomially small min-entropy independent sources," in Proc. of 38th STOC, 2006.
8. o(1) entropy and Ramsey graphs beating the Frankl-Wilson construction," in Proc. of 38th STOC, 2006.
9. J. Kamp, A. Rao, S. Vadhan, and D. Zuckerman, "Deterministic extractors for small space sources," in Proc. of 38th STOC, 2006.
10. A. Gabizon and R. Raz, "Deterministic extractors for affine sources over large fields," in Proc. of 46th FOCS.
11. M. DeVos and A. Gabizon, "Simple affine extractors using dimension expansion," in Proc. of the 25th CCC.
12. J. Bourgain, "On the construction of affine-source extractors," Geometric and Functional Analysis, 2007.
13. A. Yehudayoff, "Affine extractors over prime fields," Manuscript, 2010.
14. A. Rao, "Extractors for low-weight affine sources," in Proc. of the 24th CCC, 2009.
15. E. Ben-Sasson and S. Kopparty, "Affine dispersers from subspace polynomials," in Proc. of 41st STOC, 2009.
16. Y. Kalai, X. Li, and A. Rao, "2-source extractors under computational assumptions and cryptography with defective randomness," in Proc. of 50th FOCS, 2009.
17. L. Trevisan, "Extractors and pseudorandom generators," Journal of the ACM, pp. 860-879, 2001.
18. D. Zuckerman, "Linear degree extractors and the inapproximability of max clique and chromatic number," in Theory of Computing, 2007, pp. 103-128.
19. R. Impagliazzo, L. Levin, and M. Luby, "Pseudo-random generation from one-way functions," in Proc. of 21st STOC, 1989, pp. 12-24.
20. C. J. Lu, O. Reingold, S. Vadhan, and A. Wigderson, "Extractors: Optimal up to constant factors," in Proc. of 35th STOC, 2003, pp. 602-611.
21. E. Viola and A. Wigderson, "Norms, xor lemmas, and lower bounds for polynomials and protocols," Theory of Computing, vol. 4, no. 7, pp. 137-168, 2008.
22. A. Bhattacharyya, S. Kopparty, G. Schoenebeck, M. Sudan, and D. Zuckerman, "Optimal testing of reed-muller codes," in Proc. of 51th FOCS, 2010.
23. E. Haramaty and A. Shpilka, "On the structure of cubic and quartic polynomials," ECCC, Tech. Rep. TR09-080.
24. B. Chor and O. Goldreich, "Unbiased bits from sources of weak randomness and probabilistic communication complexity," SIAM Journal on Computing, vol. 17, no. 2, pp. 230-261, 1988.
25. U. Vazirani, "Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources (extended abstract)," in Proc. of 17th STOC, 1985.
26. O. Goldreich, "Three xor-lemmas - an exposition," ECCC, Tech. Rep. TR95-056, 1995.
27. J. Justensen, "A class of constructive asymptotically good algebraic codes," IEEE Trans. Info. Theory., vol. 18, p. 652656, 1972.