From partial consistency to global broadcast

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 494-503

  Fitzi, Mattias ^a   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST CHANNELS; RELIABLE BROADCAST; SYNCHRONOUS NETWORKS; THE STANDARD MODEL; UNCONDITIONALLY SECURE;

COMPUTATION THEORY; FAULT TOLERANT COMPUTER SYSTEMS;

COMMUNICATION CHANNELS (INFORMATION THEORY); DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS;

GLOBAL BROADCAST;

EID: 0033702889     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335363     Document Type: Conference Paper

References (20)

1. Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, and H. Raymond Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. In Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 42-51, Vancouver, British Columbia, Canada, 10-12 August 1987.
2. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 1-10, 1988.
3. Piotr Berman, Juan A. Garay, and Kenneth J. Perry. Towards optimal distributed consensus (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, pages 410-415, Research Triangle Park, North Carolina, 30 October-1 November 1989. IEEE.
4. David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 11-19, 1988.
5. Brian A. Coan and Jennifer L. Welch. Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation, 97(1):61-85, March 1992.
6. Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, and Tal Rabin. Efficient multiparty computations secure against an adaptive adversary. In Advances in Cryptology - EUROCRYPT '99, Lecture Notes in Computer Science, 1999.
7. Danny Dolev. The Byzantine generals strike again. Journal of Algorithms, 3(1):14-30, 1982.
8. Danny Dolev, Cynthia Dwork, Orli Waarts, and Moti Yung. Perfectly secure message transmission. Journal of the ACM, 40(1):17-47, January 1993.
9. Danny Dolev, Michael J. Fischer, Rob Fowler, Nancy A. Lynch, and H. Raymond Strong. An efficient algorithm for Byzantine agreement without authentication. Information and Control, 52(3):257-274, March 1982. (Pubitemid 14484053)
10. Pesech Feldman and Silvio Micali. Optimal algorithms for Byzantine agreement. In Proc. 20th ACM Symposium on the Theory of Computing (STOC), pages 148-161, 1988.
11. Matthew Franklin and Moti Yung. Secure hypergraphs: Privacy from partial broadcast (extended abstract). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 36-44, Las Vegas, Nevada, 29 May-1 June 1995.
12. Matthew K. Franklin and Rebecca N. Wright. Secure communication in minimal connectivity models. In Kaisa Nyberg, editor, Advances in Cryptology: EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science. Springer, 1998.
13. Juan A. Garay and Yoram Moses. Fully polynomial Byzantine agreement in t + 1 rounds (extended abstract). In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pages 31-41, San Diego, California, 16-18 May 1993.
14. Juan A. Garay and Kenneth J. Perry. A continuum of failure models for distributed computing. In Adrian Segall and Shmuel Zaks, editors, Distributed Algorithms, 6th International Workshop, WDAG '92, volume 647 of Lecture Notes in Computer Science, pages 153-165, Haifa, Israel, 2-4 November 1992. Springer.
15. Anna Karlin and Andrew C. Yao. Manuscript.
16. Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann series in data management systems. Morgan Kaufmann Publishers, Los Altos, CA 94022, USA, 1996.
17. Marshall Pease, Robert Shostak, and Leslie Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, April 1980.
18. Tal Rabin and Michael Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symposium on the Theory of Computing (STOC), pages 73-85, 1989.
19. Sam Toueg, Kenneth J. Perry, and T. K. Srikanth. Fast distributed agreement. SIAM Journal on Computing, 16(3):445--457, June 1987.
20. Russell Turpin and Brian A. Coan. Extending binary Byzantine Agreement to multivalued Byzantine Agreement. Information Processing Letters, 18(2):73-76, February 1984. (Pubitemid 14570886)