Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- 1 March 1992
- journal article
- Published by Elsevier in Information and Computation
- Vol. 97 (1) , 61-85
- https://doi.org/10.1016/0890-5401(92)90004-y
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreementInformation and Computation, 1992
- Consensus algorithms with one-bit messagesDistributed Computing, 1991
- Early stopping in Byzantine agreementJournal of the ACM, 1990
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- A Simple and Efficient Randomized Byzantine Agreement AlgorithmIEEE Transactions on Software Engineering, 1985
- Bounds on information exchange for Byzantine agreementJournal of the ACM, 1985
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982