Loading...
conference paper
A Leader-Free Byzantine Consensus Algorithm
2010
Proceedings of the 11th International Conference on Distributed Computing and Networking (ICDCN)
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.
Loading...
Name
LeaderFree.pdf
Access type
openaccess
Size
204.16 KB
Format
Adobe PDF
Checksum (MD5)
cf37c6313e9f8c9056e5281827021b8e