Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
CSC '91 Proceedings of the 19th annual conference on Computer Science
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
IEEE Transactions on Software Engineering
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Unreliable Intrusion Detection in Distributed Computations
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
The SecureRing Protocols for Securing Group Communication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3
Randomized Byzantine Agreements
PODC '84 Proceedings of the third 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
Non-blocking atomic commit in asynchronous distributed systems with failure detectors
Distributed Computing
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
Solving Vector Consensus with a Wormhole
IEEE Transactions on Parallel and Distributed Systems
Low complexity Byzantine-resilient consensus
Distributed Computing
Orchestrating fair exchanges between mutually distrustful web services
Proceedings of the 3rd ACM workshop on Secure web services
Worm-IT - A wormhole-based intrusion-tolerant group communication system
Journal of Systems and Software
A Parsimonious Approach for Obtaining Resource-Efficient and Trustworthy Execution
IEEE Transactions on Dependable and Secure Computing
Research note: On Byzantine generals with alternative plans
Journal of Parallel and Distributed Computing
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
Enhanced Fault-Tolerance through Byzantine Failure Detection
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Asynchronous Byzantine consensus with 2f+1 processes
Proceedings of the 2010 ACM Symposium on Applied Computing
Byzantine consensus with few synchronous links
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Secure failure detection in TrustedPals
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The failure detector abstraction
ACM Computing Surveys (CSUR)
Failure detection with booting in partially synchronous systems
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Analysis for REPERA: A Hybrid Data Protection Mechanism in Distributed Environment
International Journal of Cloud Applications and Computing
Hi-index | 0.01 |
Separating different aspects of a program, and encapsulating them inside well defined modules, is considered a good engineering discipline. This discipline is particularly desirable in the development of distributed agreement algorithms which are known to be difficult and error prone. For such algorithms, one aspect that is important to encapsulate is failure detection. In fact, a complete encapsulation was proven to be feasible in the context of distributed systems with process crash failures, by using black-box failure detectors. This paper discusses the feasibility of a similar encapsulation in the context of Byzantine (also called arbitrary or malicious) failures. We argue that, in the Byzantine context, it is just impossible to achieve the level of encapsulation of the original crash failure detector model. However, we also argue that there is some room for an intermediate approach where algorithms that solve agreement problems, such as consensus and atomic broadcast, can still benefit from grey-box failure detectors that partially encapsulate Byzantine failure detection.