Problems in fault-tolerant distributed computing have been studied in a variety of models.
These models are structured around two central ideas:(1) degree of synchrony and failure …

Fault-tolerant distributed algorithms play an important role in many critical/high-availability
applications. These algorithms are notoriously difficult to implement correctly, due to …

Partially synchronous Byzantine consensus protocols typically structure their execution into
a sequence of views, each with a designated leader process. The key to guaranteeing …

In many edge computing applications, edge devices are required to reach fault-tolerant
consensus in order to provide collaborative services in outdoor environments. In this paper …

Asynchronous Byzantine consensus algorithms are an important primitive for building
Byzantine fault-tolerant systems. Algorithms for Byzantine consensus typically require at …

The openness of wireless networks opens the door to Byzantine attacks on the physical
channels, making the communications unreliable and resulting in more challenges in …

Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the
presence of malicious replicas and lies at the heart of the modern blockchain technology …

Fault-tolerant consensus has been studied extensively in the literature, because it is one of
the important distributed primitives and has wide applications in practice. This paper surveys …

We provide a suite of impossibility results and lower bounds for the required number of
processes and rounds for synchronous consensus under transient link failures. Our results …

Fault-tolerant distributed algorithms play an important role in ensuring the reliability of many
software applications. In this paper we consider distributed algorithms whose computations …