The best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocols
- 1 October 1990
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 36 (1), 45-49
- https://doi.org/10.1016/0020-0190(90)90185-z
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Coordinated traversal: (t+1)-round Byzantine agreement in polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- An O (log n ) expected rounds randomized byzantine generals protocolJournal of the ACM, 1987
- A Simple and Efficient Randomized Byzantine Agreement AlgorithmIEEE Transactions on Software Engineering, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Simple constant-time consensus protocols in realistic failure models (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocolsPublished by Association for Computing Machinery (ACM) ,1983
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980