Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Easy impossibility proofs for distributed consensus problems
Distributed Computing
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Asymptotically optimal algorithms for approximate agreement
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Asynchronous byzantine agreement protocols
Information and Computation
Achieving consensus in fault-tolerant distributed computer systems: protocols, lower bounds, and simulations
Fault-tolerant decision making in totally asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Automatically increasing the fault-tolerance of distributed systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Simplifying fault-tolerance: providing the abstraction of crash failures
Journal of the ACM (JACM)
Characterizing distributed systems using knowledge-based models: preliminary version
TARK '92 Proceedings of the 4th conference on Theoretical aspects of reasoning about knowledge
PeerReview: practical accountability for distributed systems
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Nysiad: practical protocol transformation to tolerate Byzantine failures
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Asynchronous Byzantine consensus with 2f+1 processes
Proceedings of the 2010 ACM Symposium on Applied Computing
Making distributed applications robust
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Structured derivation of semi-synchronous algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
On the (limited) power of non-equivocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Practical hardening of crash-tolerant systems
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
| Hi-index | 14.98 |
A compiler that increases the fault tolerance of certain asynchronous protocols is presented. Specifically, it transforms a source protocol that is resilient to crash faults into an object protocol that is resilient to Byzantine faults. The compiler simplifies the design of protocols for the Byzantine fault model because it allows the design process to be broken in two steps. The first step is to design a protocol for the crash fault model. The second step, which is completely mechanical, is to compile the protocol into one for the Byzantine fault model. The compiler is used to produce an asynchronous approximate agreement protocol that operates in the Byzantine fault model and improves in several respects on the performance of the asynchronous approximate agreement protocol of D. Dolev et al. (1986).