Modular construction of an efficient 1-bit Byzantine agreement protocol
- 1 March 1993
- journal article
- research article
- Published by Springer Science and Business Media LLC in Theory of Computing Systems
- Vol. 26 (1), 131-154
- https://doi.org/10.1007/bf01187076
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient agreement using fault diagnosisDistributed Computing, 1993
- Modular construction of a Byzantine agreement protocol with optimal message bit complexityInformation and Computation, 1992
- Consensus algorithms with one-bit messagesDistributed Computing, 1991
- Towards optimal distributed consensusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- 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
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980