From partial consistency to global broadcast
Authors:
Open Access
- 1 May 2000
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 494-503
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Perfectly secure message transmissionJournal of the ACM, 1993
- Fully polynomial Byzantine agreement in t + 1 rounds1993
- Modular construction of a Byzantine agreement protocol with optimal message bit complexityInformation and Computation, 1992
- A continuum of failure models for distributed computingLecture Notes in Computer Science, 1992
- Verifiable secret sharing and multiparty protocols with honest majority1989
- Fast Distributed AgreementSIAM Journal on Computing, 1987
- Extending binary Byzantine agreement to multivalued Byzantine agreementInformation Processing Letters, 1984
- The Byzantine generals strike againJournal of Algorithms, 1982
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980