Simple affine extractors using dimension expansion

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2010, Pages 50-57

  DeVos, Matt ^a   Gabizon, Ariel ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AFFINE SUBSPACES; FIELD SIZE; LINEAR MAPS; LOWER BOUNDS; NEW RESULTS; NON-TRIVIAL; QUADRATIC RESIDUES;

COMPUTATIONAL COMPLEXITY;

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

References (42)

1. A. Gabizon and R. Raz, "Deterministic extractors for affine sources over large fields," in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, 2005, pp. 407-418.
2. J. Bourgain, "On the construction of affine extractors," Geometric & Functional Analysis, vol. 17 Number 1, pp. 33-57, 2007.
3. X. Hour, K. Leung, and Q. Xiang, "A generalization of an addition theorem of kneser," Journal of Number Theory, vol. 97, pp. 1-9, 2002.
4. 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, Apr. 1988, special issue on cryptography.
5. J. von Neumann, "Various techniques used in connection with random digits," Applied Math Series, vol. 12, pp. 36-38, 1951.
6. M. Blum, "Independent unbiased coin flips from a correlated biased source: a finite state Markov chain," in Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, 1984, pp. 425-433.
7. M. Santha and U. V. Vazirani, "Generating quasi-random sequences from semi-random sources," Journal of Computer and System Sciences, vol. 33, pp. 75-87, 1986.
8. U. Vazirani, "Efficient considerations in using semi-random sources," in Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, 1987.
9. -, "Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources," Combinatorica, vol. 7, pp. 375-392, 1987.
10. B. Barak, R. Impagliazzo, and A. Wigderson, "Extracting randomness from few independent sources," in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
11. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson, "Simulating independence: New consturctions of condenesers, ramsey graphs, dispersers, and extractors," in Submitted, 2004.
12. Y. Dodis, A. Elbaz, R. Oliveira, and R. Raz, "Improved randomness extraction from two independent sources," in RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science. LNCS, 2004.
13. R. Raz, "Extractors with weak random seeds," in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005.
14. 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 Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006.
15. L. Trevisan and S. Vadhan, "Extracting randomness from samplable distributions," in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000.
16. J. Kamp, A. Rao, S. Vadhan, and D. Zuckerman, "Deterministic extractors for small-space sources," in STOC: ACM Symposium on Theory of Computing (STOC), 2006.
17. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky, "The bit extraction problem or t-resilient functions," in Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985.
18. J. Kamp and D. Zuckerman, "Deterministic extractors for bit-fixing sources and exposure-resilient cryptography," in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
19. A. Gabizon, R. Raz, and R. Shaltiel, "Determinsitic extractors for bitfixing sources by obtaining an independent seed," in FOCS 2004, 2004.
20. A. Rao, "Extractors for low-weight affine sources," in IEEE Conference on Computational Complexity. IEEE Computer Society, 2009, pp. 95-101. [Online]. Available: http://doi.ieeecomputersociety.org/10.1109/CCC.2009.36
21. U. Vazirani and V. Vazirani, "Random polynomial time is equal to semi-random polynomial time," Cornell University, Computer Science Department, Technical Report TR88-959, Dec. 1988.
22. A. Cohen and A. Wigderson, "Dispersers, deterministic amplification, and weak random sources," in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989.
23. D. Zuckerman, "General weak random sources," in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 534-543.
24. -, "Simulating BPP using a general weak random source," Algorithmica, vol. 16, no. 4/5, pp. 367-391, Oct./Nov. 1996.
25. N. Nisan and D. Zuckerman, "Randomness is linear in space," Journal of Computer and System Sciences, vol. 52, no. 1, pp. 43-52, 1996.
26. N. Nisan, "Extracting randomness: How and why: A survey," in Proceedings of the 11th Annual IEEE Conference on Computational Complexity, 1996, pp. 44-58.
27. N. Nisan and A. Ta-Shma, "Extracting randomness: A survey and new constructions," Journal of Computer and System Sciences, vol. 58, 1999.
28. R. Shaltiel, "Recent developments in explicit constructions of extractors," Bulletin of the EATCS, vol. 77, pp. 67-95, 2002.
29. S. Vadhan, "Randomness extractors and their many guises," in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 9-12.
30. A. Shamir, "On the generation of cryptographically strong pseudorandom sequences," ACM Trans. on Computer Sys., vol. 1, no. 1, p. 38, Feb. 1983.
31. M. Blum and S. Micali, "How to generate cryptographically strong sequences of pseudo-random bits," SIAM Journal on Computing, vol. 13, no. 4, pp. 850-864, Nov. 1984.
32. A. C. Yao, "Theory and applications of trapdoor functions (extended abstract)," in 23rd Annual Symposium on Foundations of Computer Science. Chicago, Illinois: IEEE, 3-5 Nov. 1982, pp. 80-91.
33. N. Nisan and A. Wigderson, "Hardness vs randomness," Journal of Computer and System Sciences, vol. 49, no. 2, pp. 149-167, Oct. 1994.
34. O. Reingold, "Undirected st-connectivity in log-space," in STOC, 2005, pp. 376-385.
35. Z. Karnin and A. Shpilka, "Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in," in IEEE Conference on Computational Complexity. IEEE Computer Society, 2008, pp. 280-291. [Online]. Available: http://doi.ieeecomputersociety.org/10.1109/CCC. 2008.15
36. N. Kayal and S. Saraf, "Blackbox polynomial identity testing for depth 3 circuits," in FOCS. IEEE Computer Society, 2009, pp. 198-207. [Online]. Available: http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.67
37. N. Saxena and C. Seshadhri, "From sylvester-gallai configurations to rank bounds: Improved black-box identity test for depth-3 circuits," CoRR, vol. abs/1002.0145, 2010, informal publication. [Online]. Available: http://arxiv.org/abs/1002.0145
38. A. Yehudayoff, "Affine extractors over prime fields," Manuscript, 2009.
39. E. Ben-Sasson and S. Kopparty, "Affine dispersers from subspace polynomials," in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009, pp. 65-74. [Online]. Available: http://doi.acm.org/10.1145/ 1536414.1536426
40. A. Weil, "On some exponential sums," in Proc. Nat. Acad. Sci. USA, vol. 34, 1948, pp. 204-207.
41. W. M. Schmidt, Equations over Finite Fields: An Elementary Approach. Springer-Verlag, Lecture Notes in Mathematics, 1976, vol. 536.
42. J. Nagura, "On the interval containing at least one prime number." Proceedings of the Japan Academy, vol. 28, pp. 177-181, 1952.