Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Automatically increasing the fault-tolerance of distributed algorithms
Journal of Algorithms
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
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
Abstractions for Devising Byzantine-Resilient State Machine Replication
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Consensus with Byzantine Failures and Little System Synchrony
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Low complexity Byzantine-resilient consensus
Distributed Computing
IEEE Transactions on Dependable and Secure Computing
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Bosco: One-Step Byzantine Asynchronous Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Brief announcement: tolerating permanent and transient value faults
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
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.