Simulating authenticated broadcasts to derive simple fault-tolerant algorithms
- 1 June 1987
- journal article
- Published by Springer Science and Business Media LLC in Distributed Computing
- Vol. 2 (2), 80-94
- https://doi.org/10.1007/bf01667080
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Applications of Byzantine agreement in database systemsACM Transactions on Database Systems, 1986
- A communication-efficient canonical form for fault-tolerant distributed protocolsPublished by Association for Computing Machinery (ACM) ,1986
- Elections in the presence of faultsPublished by Association for Computing Machinery (ACM) ,1984
- A new fault-tolerant algorithm for clock synchronizationPublished by Association for Computing Machinery (ACM) ,1984
- Fault-tolerant clock synchronizationPublished by Association for Computing Machinery (ACM) ,1984
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983
- The consensus problem in unreliable distributed systems (a brief survey)Lecture Notes in Computer Science, 1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982