Improved randomness extraction from two independent sources

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 334-344

  Dodis, Yevgeniy ^a   Elbaz, Ariel ^b   Oliveira, Roberto ^c   Raz, Ran ^d  

^a POLYTECHNIC UNIVERSITY   (United States)

^b Columbia University ^*  (United States)

^c NEW YORK UNIVERSITY   (United States)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BLENDING; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM PROCESSES;

INDEPENDENT SOURCES; MIN-ENTROPY; RANDOM SOURCES; RANDOMNESS EXTRACTIONS; TECHNICAL TOOLS; TWO SOURCES;

APPROXIMATION ALGORITHMS;

EID: 20544433132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_30     Document Type: Article

References (29)

1. N. Alon. Tools from higher algebra. In Handbook of Combinatorics, R.L. Graham, M. Grötschel and L. Lovàsz, eds, North Holland (1995), Chapter 32, pp. 1749-1783.
2. A. Andreev, A. Clementi, J. Rolim, L. Trevisan. Dispersers, deterministic amplification, and weak random sources. In SIAM J. on Comput., 28(6):2103-2116, 1999.
3. B. Barak, R. Impagliazzo and A. Wigderson. Extracting Randomness from Few Independent Sources. Manuscript, 2004.
4. B. Chor, O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, 1988.
5. A. Cohen, A. Wigderson. Dispersers, deterministic amplification, and weak random sources. In Proc. of FOCS, pp. 14-19, 1989.
6. Y. Dodis, J. Spencer. On the (Non-)Universality of the One-Time Pad. In Proc. of FOCS, 2002.
7. Y. Dodis, R. Oliveira. On Extracting Private Randomness over a Public Channel. In RANDOM-APPROX 252-263, 2003.
8. O. Goldreich. Three XOR-Lemmas - An Exposition. Electronic Colloquium on Computational Complexity (ECCC), 1995.
9. R.L. Graham, J.H. Spencer. A constructive solution to a tournament problem. In Canad. Math. Bull. 14, 45-48.
10. C. Lu, O. Reingold, S. Vadhan, A. Wigderson. Extractors: Optimal Up to Constant Factors. In Proc. of STOC, 2003.
11. U. Maurer, S. Wolf. Privacy Amplification Secure Against Active Adversaries. In Proc. of CRYPTO, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pp. 307-321, 1997.
12. J. McInnes, B. Pinkas. On the Impossibility of Private Key Cryptography with Weakly Random Keys. In Proc. of CRYPTO, pp. 421-435, 1990.
13. R. Meshulam. Spaces of Hankel matrices over finite fields. Linear Algebra and its Applications, 218, 1995.
14. E. Mossel, A. Shpilka, L. Trevisan. On ε-biased Generators in NC°. In Proc. of FOCS, 2003.
15. N. Nisan, A. Ta-Shma. Extracting Randomness: a survey and new constructions. In JCSS, 58(1):148-173, 1999.
16. N. Nisan, D. Zuckerman. Randomness is Linear in Space. In JCSS, 52(1):43-52, 1996.
17. R. Raz, O. Reingold, S. Vadhan. Extracting all the randomness and reducing the error in Trevisan's extractors. Journal of Computer and System Sciences, 2002.
18. L. Rónyai, L. Babai, M. Ganapathy. On the number of zero-patterns in a sequence of polynomials Journal of the AMS, 2002.
19. R. Roth. Maximum rank array codes and their application to crisscross error correction. IEEE transactions on Information Theory, 37, 1991.
20. M. Sántha, U. Vazirani. Generating Quasi-Random Sequences from Semi-Random Sources. Journal of Computer and System Sciences, 33(1):75-87, 1986.
21. R. Shaltiel. Recent developments in Explicit Constructions of Extractors. Bulletin of the EATCS, 77:67-95, 2002.
22. R. Shaltiel, C. Umans. Simple extractors for all min-entropies and a new pseudorandom generator. In Proceedings of FOCS 2001, pp.648-657, IEEE Computer Society, 2001.
23. L. Trevisan. Construction of Extractors Using PseudoRandom Generators. In Proc. of STOC, pp. 141-148, 1999.
24. U. Vazirani. Randomness, Adversaries and Computation. PhD Thesis, University of California, Berkeley, 1986.
25. U. Vazirani. Strong Communication Complexity or Generating Quasi-Random Sequences from Two Communicating Semi-Random Sources. Combinatorica, 7(4):375-392, 1987.
26. U. Vazirani, V. Vazirani. Random polynomial time is equal to slightly-random polynomial time. In Proc. of 26th FOCS, pp. 417-428, 1985.
27. U. Vazirani. Efficiency Considerations in using semi-random sources. In Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 160-168, 1987.
28. A. Wigderson. Open problems. Notes from DIMACS Workshop on Pseudorandomness and Explicit Combinatorial Constructions, 1999
29. D. Zuckerman. Simulating BPP Using a General Weak Random Source. Algorithmica, 16(4/5):367-391, 1996.