Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 1-10

  Barak, Boaz ^a   Kindler, Guy ^a   Shaltiel, Ronen ^b   Sudakov, Benny ^c   Wigderson, Avi ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

Dispersers Condenser; Explicit Constructions; Extractors; Ramsey Graphs

Indexed keywords

DISPERSERS CONDENSER; EXPLICIT CONSTRUCTIONS; EXTRACTORS; RAMSEY GRAPHS;

ENTROPY; FUNCTIONS; GRAPH THEORY;

CAPACITORS;

EID: 34848820045     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. B. Barak, R. Impagliazzo, and A. Wigderson. Extracting randomness from few independent sources. In Proc. 45th FOCS , 2004.
2. B. Barak, R. Shaltiel, and E. Tromer. True random number generators secure in a changing environment. In Workshop on Cryptographic Hardware and Embedded Systems (CHES), pages 166-180, 2003. LNCS no. 2779.
3. M. Ben-Or and N. Linial. Collective coin flipping, robust voting schemes and minima of Banzhaf values. In Proc. 26th FOCS, pages 408-416, 1985.
4. E. Ben-Sasson, S. Hoory, E. Rosenman, and S. Vadhan. Personal communication, 2001.
5. M. Blum. Independent unbiased coin flips from a correlated biased source: A finite state Markov chain. In Proc. 25th FOCS, pages 425-433, 1984.
6. J. Bourgain. More on the Sum-Product Phenomenon in Prime Fields and its Applications, 2005. Unpublished manuscript.
7. J. Bourgain, N. Katz, and T. Tao. A sum-product estimate in finite fields, and applications. Arxiv technical report, http://arxiv.org/abs/math.CO/0301343, 2003. To appear in GAFA.
8. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders. In Proc. 34th STOC, pages 659-668. ACM, 2002.
9. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. In Proc. 26th FOCS, pages 429-442, 1985.
10. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky. The bit extraction problem oft-resilient functions (preliminary version). In Proc. 26th FOCS, pages 396-407, 1985.
11. A. Cohen and A. Wigderson. Dispersers, deterministic amplification, and weak random sources. In Proc. 30th FOCS, pages 14-19. IEEE, 1989.
12. Y. Dodis, A. Elbaz, R. Oliveira, and R. Raz. Improved randomness extraction from two independent sources. In Proc. of 8th RANDOM, 2004.
13. Y. Dodis and J. Spencer. On the (non)universality of the one-time pad. In Proc. 43rd FOCS, pages 376-388. IEEE, 2002.
14. P. Frankl and R. M. Wilson. Intersection theorems with geometric consequences. Combinatorica, 1(4):357-368, 1981.
15. A. Gabizon, R. Raz, and R. Shaltiel. Deterministic extractors for bit-fixing sources by obtaining an independent seed. In Proc. 45th FOCS, 2004.
16. Kamp and Zuckerman. Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In Proc. 44th FOCS. IEEE, 2003.
17. C.-J. Lu, O. Reingold, S. Vadhan, and A. Wigderson. Extractors: optimal up to constant factors. In Proc. 35th STOC, pages 602-611. ACM, 2003.
18. J. L. McInnes and B. Pinkas. On the impossibility of private key cryptography with weakly random keys. In Crypto '90, pages 421-436, 1990. LNCS No. 537.
19. Mossel and Umans. On the complexity of approximating the VC dimension. J. Comput. Syst. Sci., 65, 2002.
20. P. Pudlak. On explicit ramsey graphs and estimates on the numbers of sums and products, 2005. Unpublished manuscript.
21. P. Pudlák and V. Rödl. Pseudorandom sets and explicit constructions of ramsey graphs, 2004. Submitted for publication.
22. R. Raz. Extractors with weak random seeds, 2004. Appears in these proceedings.
23. O. Reingold, R. Shaltiel, and A. Wigderson. Extracting randomness via repeated condensing. In Proc. 41st FOCS, pages 22-31, 2000.
24. M. Santha and U. V. Vazirani. Generating quasi-random sequences from slightly-random sources. In Proc. 25th FOCS, pages 434-440, 1984.
25. R. Shaltiel. Recent developments in extractors. Bulletin of the European Association for Theoretical Computer Science, 2002. Available from http://www.wisodm,weizmann.ac.il/~ronens.
26. A. Ta-Shma, C. Umans, and Z. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proc. 42nd FOCS, pages 143-152. IEEE, 2001.
27. L. Trevisan and S. Vadhan. Extracting randomness from samplable distributions. In Proc. 41st FOCS , pages 32-42, 2000.
28. U. Vazirani. Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources. Combinatorica, 7, 1987.
29. Preliminary version in STOC' 85.
30. J. von Neumann. Various techniques used in connection with random digits. Applied Math Series, 12:36-38, 1951.
31. D. Zuckerman. General weak random sources. In Proc. 31st FOCS, pages 534-543. IEEE, 1990.