Deterministic extractors for small-space sources

Journal of Computer and System Sciences

Volumn 77, Issue 1, 2011, Pages 191-220

  Kamp, Jesse ^a   Rao, Anup ^b   Vadhan, Salil ^c   Zuckerman, David ^d  

^a ORACLE CORPORATION   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c HARVARD UNIVERSITY   (United States)

^d University of Texas at Austin   (United States)

Author keywords

Bit fixing sources; Independent sources; Markov chains; Pseudorandomness; Randomness extractors; Samplable sources

Indexed keywords

MARKOV CHAINS; POLYNOMIAL APPROXIMATION;

BIT-FIXING SOURCES; DETERMINISTIC EXTRACTOR; INDEPENDENT SOURCES; POLYNOMIAL-TIME; PSEUDORANDOMNESS; RANDOMNESS EXTRACTORS; TOTAL ENTROPY; VARIATION DISTANCE;

ENTROPY;

EID: 78349308585     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.06.014     Document Type: Article

References (47)

1. N. Alon, and J.H. Spencer The Probabilistic Method Wiley-Interscience Series 2000 John Wiley & Sons, Inc. New York
2. Charles H. Bennett, Gilles Brassard, and Robert Jean-Marc Privacy amplification by public discussion SIAM J. Comput. 17 2 April 1988 210 229
3. J. Bourgain, A. Glibichuk, and S. Konyagin Estimates for the number of sums and products and for exponential sums in fields of prime order J. Lond. Math. Soc. 73 2 2006 380 398
4. B. Barak, R. Impagliazzo, and A. Wigderson Extracting randomness using few independent sources SIAM J. Comput. 36 2006 1095 1118
5. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson, Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors, in: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 1-10.
6. M. Blum Independent unbiased coin flips from a correlated biased source: A finite Markov chain Combinatorica 6 2 1986 97 108
7. M. Ben-Or, and N. Linial Collective coin flipping S. Micali, Randomness and Computation 1990 Academic Press New York 91 115
8. J. Bourgain More on the sum-product phenomenon in prime fields and its applications Int. J. Number Theory 1 2005 1 32
9. M. Bellare, J. Rompel, Randomness-efficient oblivious sampling, in: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 276-287.
10. Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, and Amit Sahai Exposure-resilient functions and all-or-nothing transforms Bart Preneel, Advances in Cryptology - EUROCRYPT 2000 Lecture Notes in Comput. Sci. vol. 1807 May 2000 Springer-Verlag 453 469
11. B. Chor, J. Friedman, O. Goldreich, J. Håstad, S. Rudich, R. Smolensky, The bit extraction problem or t-resilient functions, in: Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 396-407.
12. B. Chor, and O. Goldreich Unbiased bits from sources of weak randomness and probabilistic communication complexity SIAM J. Comput. 17 2 1988 230 261
13. J.L. Carter, and M.N. Wegman Universal classes of hash functions J. Comput. System Sci. 18 1979 143 154
14. A. Cohen, A. Wigderson, Dispersers, deterministic amplification, and weak random sources, in: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 14-19.
15. Yevgeniy Dodis, Exposure-resilient cryptography, PhD thesis, MIT, 2000.
16. Yevgeniy Dodis, Impossibility of black-box reduction from non-adaptively to adaptively secure coin-flipping, Technical Report 039, Electronic Colloquium on Computational Complexity, 2000.
17. Z. Dvir, and R. Raz Analyzing linear mergers Random Structures Algorithms 32 2008 334 345
18. A. Gabizon, R. Raz, and R. Shaltiel Deterministic extractors for bit-fixing sources by obtaining an independent seed SIAM J. Comput. 36 2006 1072 1094
19. B. Jun, and P. Kocher The Intel random number generator http://www.cryptography.com/resources/whitepapers/IntelRNG.pdf 1999
20. Robert Koenig, Ueli Maurer, Extracting randomness from generalized symbol-fixing and Markov sources, in: Proceedings of 2004 IEEE International Symposium on Information Theory, June 2004, p. 232.
21. Robert Koenig, and Ueli Maurer Generalized strong extractors and deterministic privacy amplification Nigel Smart, Cryptography and Coding 2005 Lecture Notes in Comput. Sci. vol. 3796 December 2005 Springer-Verlag 322 339
22. J. Kamp, and D. Zuckerman Deterministic extractors for bit-fixing sources and exposure-resilient cryptography SIAM J. Comput. 36 2006 1231 1247
23. D. Lichtenstein, N. Linial, and M. Saks Some extremal problems arising from discrete control processes Combinatorica 9 3 1989 269 287
24. L. Lovász Random walks on graphs: A survey D. Miklós, V.T. Sós, T. Szonyi, Combinatorics Paul Erdos is Eighty vol. 2 1996 J. Bolyai Math. Soc. Budapest 353 398
25. Ueli Maurer, and Stefan Wolf Privacy amplification secure against active adversaries Burton S. Kaliski Jr. Advances in Cryptology - CRYPTO '97 Lecture Notes in Comput. Sci. vol. 1294 August 1997 Springer-Verlag 307 321
26. N. Nisan, and A. Ta-Shma Extracting randomness: A survey and new constructions J. Comput. System Sci. 58 1999 148 173
27. N. Nisan, and D. Zuckerman Randomness is linear in space J. Comput. System Sci. 52 1 1996 43 52
28. 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, 2006, pp. 497-506.
29. Ran Raz, Extractors with weak random seeds, in: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 11-20.
30. R. Raz, O. Reingold, and S. Vadhan Extracting all the randomness and reducing the error in Trevisan's extractors J. Comput. System Sci. 65 1 2002 97 128
31. Ronen Shaltiel Recent developments in explicit constructions of extractors Bull. Eur. Assoc. Theor. Comput. Sci. 77 June 2002 67 95
32. R. Shaltiel, How to get more mileage from randomness extractors, in: Proceedings of the 21st Annual IEEE Conference on Computational Complexity, 2006, pp. 49-60.
33. M. Santha, and U.V. Vazirani Generating quasi-random sequences from semi-random sources J. Comput. System Sci. 33 1986 75 87 (Pubitemid 17484840)
34. Miklós Sántha, and Umesh V. Vazirani Generating quasirandom sequences from semirandom sources Twenty-fifth Annual Symposium on Foundations of Computer Science Singer Island, Fla., 1984 J. Comput. System Sci. 33 1 1986 75 87
35. L. Trevisan Extractors and pseudorandom generators J. ACM 2001 860 879
36. A. Ta-Shma, On extracting randomness from weak random sources, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 276-285.
37. Luca Trevisan, Salil P. Vadhan, Extracting randomness from samplable distributions, in: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 32-42.
38. S. Vadhan On constructing locally computable extractors and cryptosystems in the bounded-storage model J. Cryptology 17 1 Winter 2004 43 77
39. U.V. Vazirani, Randomness, adversaries and computation, PhD thesis, EECS, University of California at Berkeley, 1986.
40. Umesh V. Vazirani, Efficiency considerations in using semi-random sources (extended abstract), in: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, New York City, 25-27 May 1987, pp. 160-168.
41. Umesh V. Vazirani Strong communication complexity or generating quasirandom sequences from two communicating semirandom sources Combinatorica 7 4 1987 375 392
42. J. von Neumann Various techniques used in connection with random digits National Bureau of Standards, Applied Mathematics Series 12 1951 36 38
43. U.V. Vazirani, V.V. Vazirani, Random polynomial time is equal to slightly-random polynomial time, in: Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 417-428.
44. N.C. Wormald The differential equation method for random graph processes and greedy algorithms M. Karonski, H.J. Proemel, Lectures on Approximation and Randomized Algorithms 1999 PWN Warsaw 73 155
45. A. Wigderson, and D. Zuckerman Expanders that beat the eigenvalue bound: Explicit construction and applications Combinatorica 19 1 1999 125 138
46. D. Zuckerman Simulating BPP using a general weak random source Algorithmica 16 1996 367 391
47. D. Zuckerman Linear degree extractors and the inapproximability of max clique and chromatic number Theory Comput. 3 2007 103 128