A leader-free Byzantine consensus algorithm

Authors:
Fatemeh Borran;André Schiper
Affiliations:
Ecole Polytechnique Fédérale de Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne, Switzerland
Venue:
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Year:
2010

Citing 15
Cited 0

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Distributed Algorithms

Distributed Algorithms
Practical byzantine fault tolerance and proactive recovery

ACM Transactions on Computer Systems (TOCS)
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
Fast Byzantine Consensus

IEEE Transactions on Dependable and Secure Computing
Tolerating corrupted communication

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Zyzzyva: speculative byzantine fault tolerance

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Randomized byzantine generals

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Bosco: One-Step Byzantine Asynchronous Consensus

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Making Byzantine fault tolerant systems tolerate Byzantine faults

NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.