Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency
verfasst von : Zarko Milosevic, Martin Hutle, André Schiper
Erschienen in: Principles of Distributed Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.