Distributed computing with imperfect randomness

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

Volumn 3724 LNCS, Issue , 2005, Pages 288-302

  Goldwasser, Shafi ^a   Sudan, Madhu ^a   Vaikuntanathan, Vinod ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; NETWORK PROTOCOLS; RANDOM PROCESSES; RESOURCE ALLOCATION;

BYZANTINE AGREEMENT; DISTRIBUTED COMPUTING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646397282     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561927_22     Document Type: Conference Paper

References (24)

1. Boaz Barak, Russell Impagliazzo, and Avi Wigderson. Extracting randomness using few independent sources. In FOCS, pages 384-393, 2004.
2. Michael Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract). In PODC, pages 27-30, 1983.
3. Michael Ben-Or and Elan Pavlov. Byzantine agreement in the full-information non-adaptive model, unpublished manuscript.
4. Gabriel Bracha. An asynchronous [(n-1)/3]-resilient consensus protocol. In PODC, pages 154-162, 1984.
5. Ran Canetti and Tal Rabin. Fast asynchronous byzantine agreement with optimal resilience. In STOC, pages 42-51, 1993.
6. Benny Chor and Brian A. Coan. A simple and efficient randomized byzantine agreement algorithm. IEEE Trans. Software Eng., 11(6):531-539, 1985.
7. Benny Chor and Oded Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. FOCS, pages 429-442, 1985.
8. Yevgeniy Dodis and Roberto Oliveira. On extracting private randomness over a public channel. In RANDOM-APPROX, pages 252-263, 2003.
9. Yevgeniy Dodis, Shien Jin Ong, Manoj P, and Amit Sahai. On the (im)possibility of cryptography with imperfect randomness. In FOCS, pages 196-205, 2004.
10. Yevgeniy Dodis and Joel Spencer. On the (non)universality of the one-time pad. In FOCS, pages 376-, 2002.
11. Cynthia Dwork, David B. Shmoys, and Larry J. Stockmeyer. Flipping persuasively in constant time. SIAM J. Comput., 19(3):472-499, 1990.
12. P. Elias. The efficient construction of an unbiased random sequence. Ann. Math. Statist., 43(3):865-870, 1972.
13. Paul Feldman. Asynchronous byzantine agreement in expected constant number of rounds, unpublished manuscript.
14. Pesech Feldman and Silvio Micali. An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput., 26(4):873-933, 1997.
15. Michael J. Fischer, Nancy A. Lynch, and Mike Paterson. Impossibility of distributed consensus with one faulty process. In PODS, pages 1-7, 1983.
16. Juan A. Garay and Yoram Moses. Fully polynomial byzantine agreement for > processors in + 1 rounds. SIAM J. Comput., 27(1):247-290, 1998.
17. Shafi Goldwasser and Vinod Vaikuntanathan. Distributed computing with imperfect randomness part n. manuscript, in preparation.
18. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM., 27:228-234, 1980.
19. Michael O. Rabin. Randomized byzantine generals. FOCS, pages 403-409, 1983.
20. Ran Raz. Extractors with weak random seeds. STOC, to appear, 2005.
21. M. Santha and U. V. Vazirani. Generating quasi-random sequences from slightly-random sources. In FOCS, pages 434-440, Singer Island, 1984.
22. Umesh V. Vazirani. Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources (extended abstract). In STOC, pages 366-378, 1985.
23. J. von Neumann. Various techniques for use in connection with random digits. In von Neumann's Collected Works, volume 5, pages 768-770. Pergamon, 1963.
24. David Zuckerman. General weak random sources. In FOCS 1990, pages 534-543, 1990.