Low complexity Byzantine-resilient consensus
- 1 March 2005
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 17 (3), 237-249
- https://doi.org/10.1007/s00446-004-0110-7
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Efficient Byzantine-resilient reliable multicast on a hybrid failure modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Consensus in Byzantine asynchronous systemsJournal of Discrete Algorithms, 2003
- The Design of a COTS Real-Time Distributed Security KernelLecture Notes in Computer Science, 2002
- How to build a timely computing base using real-time LinuxPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Encapsulating Failure Detection: From Crash to Byzantine FailuresLecture Notes in Computer Science, 2002
- Random oracles in constantipolePublished by Association for Computing Machinery (ACM) ,2000
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocolsPublished by Association for Computing Machinery (ACM) ,1983