COCA: A secure distributed online certification authority
ACM Transactions on Computer Systems (TOCS)
Distributing Trust on the Internet
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Consensus in byzantine asynchronous systems
Journal of Discrete Algorithms
Automated Online Monitoring of Distributed Applications through External Monitors
IEEE Transactions on Dependable and Secure Computing
A methodology to design arbitrary failure detectors for distributed protocols
Journal of Systems Architecture: the EUROMICRO Journal
Practical hardening of crash-tolerant systems
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
| Hi-index | 0.00 |
The design of protocols able to cope with processes exhibiting an arbitrary faulty behavior is a real practical challenge due to malicious attacks or unexpected software errors. Nowadays, there are many protocols able to cope with process crashes, but, unfortunately, a process crash represents only a particular faulty behavior. Then, a good engineering argument would be to take a protocol resilient to process crashes and to transform it into one resilient to arbitrary failures. This paper presents a generic methodology to perform the previous transformation in the case where processes run the same text and regularly exchange messages (i.e., the case of round-based protocols). This modular approach encapsulates the detection of arbitrary failures in specific modules. Such a methodology can be the starting point for designing tools that allow automatic transformation. We show an application of this methodology to the case of consensus.