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 …

We introduce a comprehensive hybrid failure model for synchronous distributed systems,
which extends a conventional hybrid process failure model by adding communication …

We address the problem of Reliable Broadcast in asynchronous message-passing systems
with n nodes, of which up to t are malicious (faulty), in addition to a message adversary that …

We address fully-defective asynchronous networks, in which all links are subject to an
unlimited number of alteration errors, implying that all messages in the network may be …

This paper investigates the problem\textit {good-case latency} of Byzantine agreement,
broadcast and state machine replication in the synchronous authenticated setting. The good …

We address the problem of Reliable Broadcast in asynchronous message-passing systems
with $ n $ nodes, of which up to $ t $ are malicious (faulty), in addition to a message …

This thesis investigates various aspects of the [Theta]-Model. The [Theta]-Model is a time
free model of distributed systems which assumes that end-to-end delays of the fastest and …

We consider the problem of reaching agreement in synchronous systems under a fault
model whose severity lies between Byzantine and crash faults. For these" mortal" Byzantine …

We consider the problem of reaching agreement in distributed systems in which some
processes may deviate from their prescribed behavior before they eventually crash. We call …

One of the most explored approaches to overcome the impossibility of distributed consensus
in fully asynchronous systems was the introduction of the concept of unreliable failure …