Network extractor protocols

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

Volumn , Issue , 2008, Pages 654-663

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

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BYZANTINE AGREEMENTS; BYZANTINE FAULTS; COMPUTATIONAL SETTINGS; DIFFIE-HELLMAN; LEADER ELECTIONS; LINEAR FRACTIONS; MIN ENTROPIES; TRAPDOOR PERMUTATIONS;

COMPUTERS; ENTROPY; FIBER OPTIC CHEMICAL SENSORS; INFORMATION THEORY; METROPOLITAN AREA NETWORKS;

COMPUTER NETWORKS;

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

References (28)

1. N. Alon and M. Naor. Coin-flipping games immune against linear-sized coalitions. SIAM Journal on Computing, 22(2):403-417, Apr. 1993.
2. 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, 28:2103-2116, 1999.
3. o(1) entropy and Ramsey graphs beating the Frankl-Wilson construction. In STOC'06, 2006.
4. M. Ben-Or and N. Linial. Collective coin flipping. Randomness and Computation, 1978.
5. R. B. Boppana and B. O. Narayanan. Perfect-information leader election with optimal resilience. SIAM J. Comput, 29(4):1304-1320, 2000.
6. R. Canetti. Towards realizing random oracles: Hash functions that hide all partial information. In CRYPTO '97, pages 455-469, 1997.
7. R. Canetti, R. Pass, and A. Shelat. Cryptography from sunspots: How to use an imperfect reference string. In FOCS'07, pages 249-259, 2007.
8. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2):230-261, 1988.
9. J. Cooper and N. Linial. Fast perfect-information leader-election protocols with linear immunity. Combinatorica, 15(3):319-332, 1995.
10. Y. Dodis and R. Oliveira. On extracting private randomness over a public channel. In RANDOM 2003, pages 252-263, 2003.
11. Y. Dodis, S. J. Ong, M. Prabhakaran, and A. Sahai. On the (im)possibility of cryptography with imperfect randomness. In FOCS'04 pages 196-205, 2004.
12. Y. Dodis and J. Spencer. On the (non)universality of the one-time pad. In FOCS'02, pages 376-385, 2002.
13. U. Feige. Noncryptographic selection protocols. In FOCS'99, pages 142-152, 1999.
14. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In STOC '87, pages 218-229, 1987.
15. S. Goldwasser, E. Pavlov, and V. Vaikuntanathan. Fault-tolerant distributed computing in full-information networks. In FOCS, pages 15-26, 2006.
16. S. Goldwasser, M. Sudan, and V. Vaikuntanathan. Distributed computing with imperfect randomness. In DISC 2005, Proceedings, volume 3724 of Lecture Notes in Computer Science, pages 288-302. Springer, 2005.
17. B. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Fast asynchronous Byzantine agreement and leader election with full information. In SODA'08, pages 1038-1047, 2008.
18. U. M. Maurer and S. Wolf. Privacy amplification secure against active adversaries. In CRYPTO '97, pages 307-321, 1997.
19. J. L. Mclnnes and B. Pinkas. On the impossibility of private key cryptography with weakly random keys. In CRYPTO '90, pages 421-435, 1990.
20. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996.
21. R. Ostrovsky, S. Rajagopalan, and U. Vazirani. Simple and efficient leader election in the full information model. In STOC'94, pages 234-242, 1994.
22. A. Rao. Extractors for a constant number of polynomially small min-entropy independent sources. In STOC'06, 2006.
23. A. Russell and D. Zuckerman. Perfect information leader election in log* n+O (1) rounds. Journal of Computer and System Sciences, 63(4):612-626, 2001.
24. M. Saks. A robust noncryptographic protocol for collective coin flipping. SIAM Journal on Discrete Mathematics, 2(2):240-244, May 1989.
25. M. Saks, A. Srinivasan, and S. Zhou. Explicit OR-dispersers with polylog degree. Journal of the ACM, 45:123-154, 1998.
26. U. V. Vazirani and V. V. Vazirani. Random polynomial time is equal to slightly-random polynomial time. In FOCS'85, pages 417-428, 1985.
27. D. Zuckerman. Simulating BPP using a general weak random source. Algorithmica, 16:367-391, 1996.
28. D. Zuckerman. Randomness-optimal oblivious sampling. Random Structures and Algorithms, 11:345-367, 1997.