Deterministic extractors for small-space sources

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 691-700

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

^a University of Texas at Austin   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Pseudorandomness; Randomness Extractors

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MATHEMATICAL MODELS; POLYNOMIALS; RANDOM PROCESSES;

MODEL SPACE; POLYNOMIAL TIME; PSEUDORANDOMNESS; RANDOMNESS EXTRACTORS;

PHASE SPACE METHODS;

EID: 33748100350     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132613     Document Type: Conference Paper

References (36)

1. B. Barak, R. Impagliazzo, and A. Wigderson, Extracting randomness using few independent sources. In 45th FOCS, pages 384-393, 2004.
2. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors, In 37th STOC, pages 1-10, 2005.
3. M. Ben-Or and N. Linial. Collective coin flipping. In S. Micali, editor, Randomness and Computation, pages 91-115, Academic Press, New York, 1990.
4. C. H. Bennett, G. Brassard, and J. Robert. Privacy amplification by public discussion, SICOMP, 17(2):210-229, Apr. 1988.
5. M. Blum. Independent unbiased coin flips from a correlated biased source: a finite Markov chain. Combinatorica, 6(2):97-108, 1986.
6. J. Bourgain. More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory, 1:1-32, 2005.
7. 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. London Math. Soc., 2005. To appear.
8. R. Canetti, Y. Dodis, S. Halevi, E. Kushilevitz, and A. Sahai. Exposure-resilient functions and all-or-nothing transforms. In B. Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807 of LNCS, pages 453-469. Springer-Verlag, May 2000.
9. B. Chor, J. Friedman, O. Goldreich, J. Håstad, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions, In 26th FOGS, pages 396-407, 1985.
10. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SICOMP, 17(2):230-261, 1988.
11. A. Cohen and A. Wigderson. Dispersers, deterministic amplification, and weak random sources. In 30th FOCS, pages 14-19, 1989.
12. H. Cramer. On the order of magnitude of the difference between consecutive prime numbers. Acta Arithmetica, pages 23-46, 1937.
13. Y. Dodis. Impossibility of black-box reduction from non-adaptively to adaptively secure coin-flipping. Unpublished manuscript, April 2000.
14. Z. Dvir and R. Raz. Analyzing linear mergers. Technical Report TR05-25, ECCC, 2005.
15. A. Gabizon, R. Raz, and R. Shaltiel. Deterministic extractors for bit-fixing sources by obtaining an independent seed. In 45th FOCS, pages 394-403, 2004.
16. B. Jun and P. Kocher. The Intel random number generator, 1999. http://www.cryptography.com/resources/whitepapers/IntelRNG.pdf.
17. J. Kamp and D. Zuckerman. Deterministic extractors for bit-fixing sources and exposure-resilient cryptography, In 44th FOCS, pages 92-101, 2003.
18. R. Koenig and U. Maurer. Extracting randomness from generalized symbol-fixing and markov sources. In Proceedings of 2004 IEEE International Symposium on Information Theory, page 232, June 2004.
19. R. Koenig and U. Maurer, Generalized strong extractors and deterministic privacy amplification. In N. Smart, editor, Cryptography and Coding 2005, volume 3796 of LNCS, pages 322-339. Springer-Verlag, Dec. 2005.
20. D. Lichtenstein, N. Linial, and M. Saks. Some extremal problems arising from discrete control processes. Combinatorial, 9(3):269-287, 1989.
21. U. Maurer and S. Wolf. Privacy amplification secure against active adversaries. In B. S. K. Jr., editor, Advances in Cryptology - CRYPTO '97, volume 1294 of LNCS, pages 307-321, Springer-Verlag, Aug. 1997.
22. N. Nisan and A. Ta-Shma. Extracting randomness: A survey and new constructions. JCSS, 58:148-173, 1999.
23. N. Nisan and D. Zuckerman, Randomness is linear in space. JCSS, 52(1):43-52, 1996.
24. A. Rao. Extractors for a constant number of polynomially small min-entropy independent sources. In 38th STOC, 2006.
25. R. Raz. Extractors with weak random seeds. In 37th STOC, pages 11-20, 2005.
26. M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources. JCSS, 33:75-87, 1986.
27. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science, (77):67-95, June 2002.
28. R. Shaltiel. How to get more mileage from randomness extractors. Technical Report TR05-145, ECCC, 2005.
29. A. Ta-Shma. On extracting randomness from weak random sources. In 28th STOC, pages 276-285, 1996.
30. L. Trevisan and S. P. Vadhan. Extracting randomness from samplable distributions. In 41st FOCS, pages 32-42, 2000.
31. U. V. Vazirani. Randomness, Adversaries and Computation. PhD thesis, EECS, University of California at Berkeley, 1986.
32. U. V. Vazirani, Strong communication complexity or generating quasirandom sequences from two communicating semirandom sources. Combinatorica, 7(4):375-392, 1987.
33. U. V. Vazirani and V. V. Vazirani. Random polynomial time is equal to slightly-random polynomial time. In 26th FOCS, pages 417-428, 1985.
34. J. von Neumann, Various techniques used in connection with random digits. National Bureau of Standards, Applied Mathematics Series, 12:36-38, 1951.
35. A. Wigderson and D. Zuckerman, Expanders that beat the eigenvalue bound: Explicit construction and applications. Combinatorica, 19(1):125-138, 1999.
36. D. Zuckerman, Simulating BPP using a general weak random source. Algorithmica, 16:367-391, 1996.