Extracting randomness using few independent sources

SIAM Journal on Computing

Volumn 36, Issue 4, 2006, Pages 1095-1118

  Barak, Boaz ^a   Impagliazzo, Russell ^b   Wigderson, Avi ^c  

^a Princeton University

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Ramsey graphs; Randomness extractors; Sum product theorem

Indexed keywords

NUMBER THEORY; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

RAMSEY GRAPHS; RANDOMNESS EXTRACTORS; SUM-PRODUCT THEOREM;

FEATURE EXTRACTION;

EID: 34247566037     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705447141     Document Type: Article

References (50)

1. M. AGRAWAL, N. KAYAL, AND N. SAXENA, PRIMES Is in P, Technical report, Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, India, 2002.
2. N. ALÓN, Tools from higher algebra, in Handbook of Combinatorics, Vol. 1, 2, Elsevier, Amsterdam, 1995, pp. 1749-1783.
3. B. BARAK, G. KINDLER, R. SHALTIEL, B. SUDAKOV, AND A. WIGDERSON, Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors, in Proceedings of the 46th STOC 05, pp. 1-10, 2005.
4. B. BARAK, A. RAO, R. SHALTIEL, AND A. WIGDERSON, 2-source dispersers for subpolynomial entropy and Ramsey graphs beating the Frankl- Wilson construction, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 671-680.
5. B. BARAK, R. SHALTIEL, AND E. TROMER, True random number generators secure in a changing environment, in Proceedings of the Workshop on Cryptographic Hardware and Embedded Systems (CHES), 2003, pp. 166-180. Lecture Notes in Comput. Sci 2779, Springer, Berlin.
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, IEEE, Los Alamitos, CA, 1984, pp. 425-433.
7. J. BOURGAIN, More on the sum-product phenomenon in prime fields and its applications, Internat. J. Number Theory, 1 (2005), pp. 1-32.
8. J. BOURGAIN, On the Construction of Affine Extractors, Geometric and Functional Analysis, to appear.
9. J. BOURGAIN, N. KATZ, AND T. TAO, A sum-product estimate in finite fields, and applications, Geom. Funct. Anal., 14 (2004), pp. 27-57.
10. B. CHOR AND O. GOLDREICH, Unbiased bits from sources of weak randomness and probabilistic communication complexity, in Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1985, pp. 429-442.
11. B. CHOR, O. GOLDREICH, J. HASTAD, J. FRIEDMAN, S. RUDICH, AND R. SMOLENSKY, The bit extraction problem of t-resilient functions (preliminary version), in Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1985, pp. 396-407.
12. 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, IEEE, Los Alamitos, CA, 1989, pp. 14-19.
13. R. COLE AND U. VISHKIN, Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing, ACM, New York, 1986, pp. 206-219.
14. Y. DODIS AND R. OLIVEIRA, On extracting private randomness over a public channel, in Approximation, Randomness, and Combinatorial Optimization, Springer, Berlin, 2003, pp. 252-263.
15. Y. DODIS AND J. SPENCER, On the (non)universality of the one-time pad, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2002, pp. 376-388.
16. A. ELBAZ, Improved Constructions for Extracting Quasi-Random Bits from Sources of Weak Randomness, Master's thesis, Weizmann Institute of Science, Rehovot, Israel, 2003.
17. P. ERDOS AND E. SZEMEREDI, On sums and products of integers, in Studies in Pure Mathematics, Birkhäuser, Basel, 1983, pp. 213-218.
18. A. FIAT AND M. NAOR, Implicit O(1) probe search, SIAM J. Comput., 22 (1993), pp. 1-10.
19. P. FRANKL AND R. M. WILSON, Intersection theorems with geometric consequences, Combinatorica, 1 (1981), pp. 357-368.
20. A. GABIZON AND R. RAZ, Deterministic extractors for affine sources over large fields, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2005, pp.407-416.
21. W. T. GOWERS, A new proof of Szemerédi's theorem for arithmetic progressions of length four, Geom. Funct. Anal., 8 (1998), pp. 529-551.
22. R. L. GRAHAM, B. L. ROTHSCHILD, AND J. L. SPENCER, Ramsey Theory, John Wiley & Sons, New York, 1980.
23. R. L. GRAHAM AND J. H. SPENCER, A constructive solution to a tournament problem, Canad. Math. Bull., 14 (1971), pp. 45-48.
24. J. HASTAD, R. IMPAGLIAZZO, L. A. LEVIN, AND M. LUBY, A pseudorandom generator from any one-way function, SIAM J. Comput., 28 (1999), pp. 1364-1396.
25. 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, IEEE, Los Alamitos, CA, 2003, pp. 92-101.
26. S.V. KONYAGIN, A Sum-Product Estimate in Fields of Prime Order, Arxiv technical report, http://arxiv.org/abs/math.NT/0304217 (2003).
27. C. J. LU, O. REINGOLD, S. VADHAN, AND A. WIGDERSON, Extractors: Optimal up to constant factors, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, ACM, New York, 2003, pp. 602-611.
28. J. L. MCINNES AND B. PINKAS, On the impossibility of private key cryptography with weakly random keys, in Crypto '90, Lecture Notes in Comput. Sci. 537, Springer, Berlin, 1990, pp. 421-436.
29. E. MOSSEL AND C. UMANS, On the complexity of approximating the VC dimension, J. Comput. System Sci., 65 (2002), pp. 660-671.
30. J. NAOR AND M. NAOR, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838-856.
31. M. B. NATHANSON, Additive Number Theory. Inverse Problems and the Geometry of Sumsets, Graduate Texts in Math. 165, Springer-Verlag, New York, 1996.
32. Y. PERES, Iterating von Neumann's procedure for extracting random bits, Ann. Statist., 20 (1992), pp. 590-597.
33. H. PLÜNNECKE, Eine zahlentheoretische Anwendung der Graphentheorie, J. Reine Angew. Math., 243 (1970), pp. 171-183.
34. P. PUDLAK, On Explicit Ramsey Graphs and Estimates of the Number of Sums and Products, Topics in Discrete Mathematics, Klazar, Kratochvil, Loebl, Matousek, Thomas, and Valtar, Springer, 2006, pp. 169-175.
35. P. PUDLAK AND V. RODL, Pseudorandom sets and explicit constructions of Ramsey graphs, Quaderni di Matematica, Vol. 13, J. Krajicek, ed., Dipartimanto di Matematica, Seconda Universita di Napoli, Caserta, 2004, pp. 327-346.
36. A. RAO, Extractors for a constant number of polynomially small min-entropy independent sources, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 497-506.
37. R. RAZ, Extractors with weak random seeds, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, ACM, New York, 2005, pp. 11-20.
38. O. REINGOLD, M. SAKS, AND A. WIGDERSON, personal communication, 2003.
39. I. RUZSA, An application of graph theory to additive number theory, Sci. Ser. A: Math. Sci., 3 (1989), pp. 97-109.
40. I. RUZSA, Sums of finite sets, in Number Theory (New York, 1991-1995), Springer, New York, 1996, pp. 281-293.
41. M. SANTHA AND U. V. VAZIRANI, Generating quasi-random sequences from slightly-random sources, in Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1984, pp. 434-440.
42. R. SHALTIEL, Recent developments in extractors, Bull. Eur. Assoc. Theoret. Comput. Sci. EATCS No. 77, (2002), pp. 67-95.
43. B. SUDAKOV, E. SZEMEREDI, AND V. H. VU, On a question of Erdos and Moser, Duke Math. J., 129 (2005), pp. 129-155.
44. L. TREVISAN AND S. VADHAN, Extracting randomness from samplable distributions, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2000, pp. 32-42.
45. U. VAZIRANI, Strong communication complexity or generating quasirandom sequences from two communicating semirandom sources, Combinatorica, 7 (1987), pp. 375-392.
46. U. VAZIRANI, Efficiency considerations in using semi-random sources, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 160-168.
47. J. VON NEUMANN, Various techniques used in connection with random digits, Appl. Math. Ser. 12 (1951), pp. 36-38.
48. D. ZUCKERMAN, General weak random sources, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1990, pp. 534-543.
49. D. ZUCKERMAN, Simulating BPP using a general weak random source, Algorithmica, 16 (1996), pp. 367-391.
50. D. ZUCKERMAN, Linear degree extractors and the inapproximability of max clique and chromatic number, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 681-690.