Advertisement
Published in:
2009 | OriginalPaper | Chapter
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency
Authors : Zarko Milosevic, Martin Hutle, André Schiper
Published in: Principles of Distributed Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes
authenticated Byzantine
faults, where messages can be signed by the sending process (with the assumption that the signature cannot be forged by any other process), and
Byzantine
faults, where there is no mechanism for signatures (but the receiver of a message knows the identity of the sender). The paper proposes an abstraction called
weak interactive consistency
(
WIC
) that unifies consensus algorithms with and without signed messages. WIC can be implemented with and without signatures.
The power of WIC is illustrated on two seminal Byzantine consensus algorithms: the Castro-Liskov PBFT algorithm (no signatures) and the Martin-Alvisi FaB Paxos algorithms (signatures). WIC allows a very concise expression of these two algorithms.