A Leader-Free Byzantine Consensus Algorithm

• Presented at: 11th International Conference on Distributed Computing and Networking (ICDCN), Kolkata, India, January 03-06
• Published in: Proceedings of the 11th International Conference on Distributed Computing and Networking (ICDCN), p. 67-78
• Series: Lecture Notes in Computer Science (LNCS) 5935
• Berlin: Springer-Verlag, 2010

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.

Keywords: Distributed algorithms ; Fault tolerance ; Byzantine consensus ; Partial synchrony ; Leader-free algorithms

Reference

• LSR-CONF-2010-001
• View record in Web of Science
• URL: http://www.icdcn.org/

Record created on 2010-01-21, modified on 2017-05-12