A Leader-Free Byzantine Consensus Algorithm

The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not the case of benign faults, which raises the following fundamental question: is it possible to design a deterministic Byzantine consensus algorithm for a partially synchronous system that is not leader-based? The paper gives a positive answer to this question, and presents a leader-free algorithm that is resilient-optimal and signature-free.


Published in:
Proceedings of the 11th International Conference on Distributed Computing and Networking (ICDCN), 67-78
Presented at:
11th International Conference on Distributed Computing and Networking (ICDCN), Kolkata, India, January 03-06
Year:
2010
Publisher:
Berlin, Springer-Verlag
Keywords:
Laboratories:




 Record created 2010-01-21, last modified 2018-01-28

External links:
Download fulltextURL
Download fulltextn/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)