Dispersers for affine sources with sub-polynomial entropy

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 247-256

  Shaltiel, Ronen ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Dispersers; Explicit construction; Pseudorandomness; Randomness extractors

Indexed keywords

AFFINE SPACE; CHALLENGE RESPONSE; DISPERSERS; EXPLICIT CONSTRUCTIONS; GENERAL SOURCE; HIGH-LEVEL APPROACH; POLYNOMIAL-TIME COMPUTABLE FUNCTIONS; PSEUDORANDOMNESS; RANDOMNESS EXTRACTORS; WIN-WIN;

COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

ENTROPY;

EID: 84863333239     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.37     Document Type: Conference Paper

References (22)

1. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson, "Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors," J. ACM, vol. 57, no. 4, 2010.
2. B. Barak, A. Rao, R. Shaltiel, and A. Wigderson, "2-source dispersers for sub-polynomial entropy and ramsey graphs beating the frankl-wilson construction," in STOC, 2006, pp. 671-680.
3. E. Ben-Sasson and S. Kopparty, "Affine dispersers from subspace polynomials," in STOC, 2009, pp. 65-74.
4. E. Ben-Sasson and N. Zewi, "From affine to two-source extractors via approximate duality," in STOC, 2011.
5. J. Bourgain, "On the construction of affine extractors," Geometric And Functional Analysis, vol. 17, no. 1, pp. 33-57, 2007.
6. E. Demenkov and A. Kulikov, "An elementary proof of 3n - o(n) lower bound on the circuit complexity of affine dispersers," Electronic Colloquium on Computational Complexity, Tech. Rep., 2011.
7. M. DeVos and A. Gabizon, "Simple affine extractors using dimension expansion," in IEEE Conference on Computational Complexity, 2010, pp. 50-57.
8. A. Gabizon and R. Raz, "Deterministic extractors for affine sources over large fields," Combinatorica, vol. 28, no. 4, pp. 415-440, 2008.
9. A. Gabizon and R. Shaltiel, "Increasing the output length of zero-error dispersers," in APPROX-RANDOM, 2008, pp. 430-443.
10. X. Li, "Improved constructions of three source extractors," in IEEE Conference on Computational Complexity, 2011.
11. -, "A new approach to affine extractors and dispersers," in IEEE Conference on Computational Complexity, 2011.
12. N. Nisan, "Extracting randomness: How and why a survey," in IEEE Conference on Computational Complexity, 1996, pp. 44-58.
13. A. Rao, "Extractors for a constant number of polynomially small min-entropy independent sources," SIAM J. Comput., vol. 39, no. 1, pp. 168-194, 2009.
14. -, "Extractors for low-weight affine sources," in IEEE Conference on Computational Complexity, 2009, pp. 95-101.
15. O. Reingold, R. Shaltiel, and A. Wigderson, "Extracting randomness via repeated condensing," SIAM J. Comput., vol. 35, no. 5, pp. 1185-1209, 2006. (Pubitemid 44599923)
16. R. Shaltiel, "Recent developments in explicit constructions of extractors," Bulletin of the EATCS, vol. 77, pp. 67-95, 2002.
17. -, "How to get more mileage from randomness extractors," Random Struct. Algorithms, vol. 33, no. 2, pp. 157-186, 2008.
18. -, "An introduction to randomness extractors," in ICALP (2), 2011, pp. 21-41.
19. R. Shaltiel and C. Umans, "Simple extractors for all minentropies and a new pseudorandom generator," J. ACM, vol. 52, no. 2, pp. 172-216, 2005. (Pubitemid 41655758)
20. S. Vadhan, "Randomness extractors and their many guises," in FOCS, 2002, pp. 9-12.
21. S. P. Vadhan, "The unified theory of pseudorandomness," SIGACT News, vol. 38, no. 3, pp. 39-54, 2007.
22. A. Yehudayoff, "Affine extractors over prime fields," Manuscript, 2010.