2-source extractors under computational assumptions and cryptography with defective randomness

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 617-626

  Kalai, Yael Tauman ^a   Li, Xin ^b   Rao, Anup ^c  

^a MICROSOFT RESEARCH   (United Kingdom)

^b University of Texas at Austin   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL ASSUMPTIONS; COMPUTATIONAL NETWORKS; LOSSLESS; MIN-ENTROPY; ONE-WAY PERMUTATION; RANDOM BITS; SECURE MULTI-PARTY COMPUTATION; SOURCE EXTRACTOR; TRAPDOOR PERMUTATIONS;

COMPUTER SCIENCE; CRYPTOGRAPHY; ENTROPY; FIBER OPTIC CHEMICAL SENSORS; RANDOM PROCESSES;

NETWORK PROTOCOLS;

EID: 77952399265     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.61     Document Type: Conference Paper

References (30)

1. B. Chor and O. Goldreich, "Unbiased bits from sources of weak randomness and probabilistic communication complexity," SIAM Journal on Computing, vol. 17, no. 2, pp. 230-261, 1988.
2. B. Barak, R. Impagliazzo, and A. Wigderson, "Extracting randomness using few independent sources," in Proc. of 45th FOCS, 2004, pp. 384-393.
3. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson, "Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors," in Proc. of 37th STOC, 2005, pp. 1-10.
4. R. Raz, "Extractors with weak random seeds," in Proc. of 37th STOC, 2005, pp. 11-20.
5. J. Bourgain, "More on the sum-product phenomenon in prime fields and its applications," International Journal of Number Theory, vol. 1, pp. 1-32, 2005.
6. A. Rao, "Extractors for a constant number of polynomially small min-entropy independent sources," in Proc. of 38th STOC, 2006.
7. o(1) entropy and Ramsey graphs beating the Frankl-Wilson construction," in Proc. of 38th STOC.
8. U. V. Vazirani and V. V. Vazirani, "Random polynomial time is equal to slightly-random polynomial time," in Proc. of 26th FOCS, 1985, pp. 417-428.
9. D. Zuckerman, "Simulating BPP using a general weak random source," Algorithmica, vol. 16, pp. 367-391, 1996.
10. M. Saks, A. Srinivasan, and S. Zhou, "Explicit OR-dispersers with polylog degree," Journal of the ACM, vol. 45, pp. 123-154, 1998.
11. A. E. Andreev, A. E. F. Clementi, J. D. P. Rolim, and L. Trevisan, "Weak random sources, hitting sets, and BPP simulations," SIAM Journal on Computing, vol. 28, no. 6, pp. 2103-2116, 1999.
12. Y. Dodis, S. J. Ong, M. Prabhakaran, and A. Sahai, "On the (im)possibility of cryptography with imperfect randomness," in FOCS04, 2004, pp. 196-205.
13. S. Goldwasser, M. Sudan, and V. Vaikuntanathan, "Distributed computing with imperfect randomness," in DISC 2005, 2005.
14. Y. T. Kalai, X. Li, A. Rao, and D. Zuckerman, "Network extractor protocols," in Proc. of 49th FOCS, 2008.
15. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game," in Proc. of 19th STOC, 1987.
16. O. Goldreich, "A candidate counterexample to the easy cylinders conjecture."
17. R. Canetti, "Towards realizing random oracles: Hash functions that hide all partial information," in Advances in Cryptology - CRYPTO '97, 17th Annual International Cryptology Conference, Proceedings, 1997.
18. H. Wee, "On obfuscating point functions," in Proc. of 37th STOC, 2005.
19. S. Dziembowski and K. Pietrzak, "Leakage-resilient cryptography," in Proc. of 49th FOCS, 2008.
20. K. Pietrzak, "A leakage-resilient mode of operation," in Advances in Cryptology - EUROCRYPT 2009, 2009.
21. A. Rao and D. Zuckerman, "Extractors for 3 uneven length sources," in Random 2008, 2008.
22. O. Goldreich and L. A. Levin, "A hard-core predicate for all one-way functions," in Proc. of 21st STOC, 1989, pp. 25-32.
23. N. Nisan and A. Wigderson, "Hardness vs randomness," Journal of Computer and System Sciences, vol. 49, no. 2, pp. 149-167, Oct. 1994.
24. L. Trevisan, "Extractors and pseudorandom generators," Journal of the ACM, pp. 860-879, 2001.
25. A. Ta-Shma and D. Zuckerman, "Extractor codes," IEEE Transactions on Information Theory, vol. 50, 2004.
26. A. Ta-Shma, C. Umans, and D. Zuckerman, "Loss-less condensers, unbalanced expanders, and extractors," in Proc. of 33rd STOC, 2001, pp. 143-152.
27. R. Shaltiel and C. Umans, "Simple extractors for all min-entropies and a new pseudorandom generator," Journal of the ACM, vol. 52, pp. 172-216, 2005.
28. C. Umans, "Reconstructive dispersers and hitting set generators," in APPROX-RANDOM, vol. 3624, 2005, pp. 460-471.
29. D. Zuckerman, "Linear degree extractors and the inap-proximability of max clique and chromatic number," in Theory of Computing, 2007, pp. 103-128.
30. U. Maurer and S. Wolf, "Privacy amplification secure against active adversaries," in Advances in Cryptology - CRYPTO '97, vol. 1294, Aug. 1997, pp. 307-321.