On extracting private randomness over a public channel

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

Volumn 2764, Issue , 2003, Pages 252-263

  Dodis, Yevgeniy ^a   Oliveira, Roberto ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLENDING; COMBINATORIAL OPTIMIZATION; ENTROPY; OPTIMIZATION; RANDOM PROCESSES;

BLOCK LENGTHS; CRYPTOGRAPHIC SYSTEMS; MIN-ENTROPY; PRIVACY AMPLIFICATION; RANDOM SOURCES;

APPROXIMATION ALGORITHMS;

EID: 30744451262     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_22     Document Type: Article

References (28)

1. M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlak. Two lower bounds for branching programs. In Proceedings of the eighteenth annual ACM symposium on Theory of computing, 30-38, 1986.
2. N. Alon and J. Spencer. The Probabilistic Method - 2nd ed. Wiley Interscience, New York, 2000.
3. A. Andreev, A. Clementi, J. Rolim, L. Trevisan. Dispersere, deterministic amplification, and weak random sources. In SIAM J. on Comput., 28(6):2103-2116, 1999.
4. C. H. Bennett, G. Brassard, C. Crépeau, U. Maurer. Generalized Privacy Amplification. In IEEE Transaction on Information Theory, vol. 41, no. 6, pp. 1915-1923, 1995
5. C. H. Bennett, G. Brassard, and J.-M. Robert. How to reduce your enemy's information. In Proc. of CRYPTO '85, Lecture Notes in Computer Science, vol. 218, pp. 468-476, Springer-Verlag, 1986.
6. B. Chor, O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 17(2):230-261, 1988.
7. A. Cohen, A. Wigderson. Dispersers, deterministic amplification, and weak random sources. In Proc. of FOCS, pp. 14-19, 1989.
8. ∼oliveira/extracting.pdf.
9. Y. Dodis, J. Spencer. On the (Non-)Universality of the One-Time Pad. In Proc. of FOCS, 2002.
10. S. Janson, T. Luksak and A. Rucinski. Random Graphs. Wiley Interscience, New York, 2000.
11. C. Lu, O. Reingold, S. Vadhan and A. Wigderson. Extractors: Optimal Up to Constant Factors. In Proc. of STOC, 2003.
12. U. Maurer and 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.
13. J. McInnes, B. Pinkas. On the Impossibility of Private Key Cryptography with Weakly Random Keys. In Proc. of CRYPTO, pp. 421-435, 1990.
14. N. Nisan, A. Ta-Shma. Extracting Randomness: a survey and new constructions. In JCSS, 58(1):148-173, 1999.
15. N. Nisan, D. Zuckerman. Randomness is Linear in Space. In JCSS, 52(1):43-52, 1996.
16. L. Rónyai, L. Babai, M. Ganapathy On the number of zero-patterns in a sequence of polynomials Journal of the AMS, 2002.
17. M. Sántha, U. Vazirani. Generating Quasi-Random Sequences from Semi-Random Sources. Journal of Computer and System Sciences, 33(1):75-87, 1986.
18. R. Shaltiel. Recent developments in Explicit Constructions of Extractors. Bulletin of the EATCS, 77:67-95, 2002.
19. R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of FOCS 2001, pp.648-657, IEEE Computer Society, 2001.
20. M. Sipser. Expanders, Randomness or Time versus Space. In Journal of Computer and Systems Sciences 36, pp. 379-383, 1988.
21. A. Ta-Shma and J. Radhakrishnan. Bounds for Dispersere, Extractors, and Depth-Two Superconcentrators. In SIAM Journal on Discrete Mathematics, 13(1):2-24, 2000.
22. L. Trevisan. Construction of Extractors Using PseudoRandom Generators. In Proc. of STOC, pp. 141-148, 1999.
23. L. Trevisan, S. Vadhan. Extracting Randomness from Samplable Distributions. In Proc. of FOCS, 2000.
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. Combinatorial, 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. A. Wigderson. Open problems. Notes from DIMACS Workshop on Pseudorandomness and Explicit Combinatorial Constructions, 1999
28. D. Zuckerman. Simulating BPP Using a General Weak Random Source. Algorithmica, 16(4/5):367-391, 1996.