This paper studies dynamic BFT, where replicas can join and leave the system dynamically,
a primitive that is nowadays increasingly needed. We provide a formal treatment for dynamic …

This paper studies Byzantine reliable broadcast (BRB) under asynchronous networks, and
improves the state-of-the-art protocols from the following aspects. Near-optimal …

We address the problem of online payments, where users can transfer funds among
themselves. We introduce Astro, a system solving this problem efficiently in a decentralized …

It is often claimed that Conflict-free Replicated Data Types (CRDTs) ensure consistency of
replicated data in peer-to-peer systems. However, peer-to-peer systems usually consist of …

A decision task is a distributed input-output problem in which each process starts with its
input value and eventually produces its output value. Examples of such decision tasks are …

Critical infrastructures have to withstand advanced and persistent threats, which can be
addressed using Byzantine fault tolerant state-machine replication (BFT-SMR). In practice …

Byzantine reliable broadcast is a fundamental problem in distributed computing, which has
been studied extensively over the past decades. State-of-the-art algorithms are …

The reconfiguration problem is considered a key challenge in distributed systems, especially
in dynamic asynchronous message-passing systems. To keep the data reliability and …

The Byzantine tolerant reliable communication primitive is a fundamental building block in
distributed systems that guarantees the authenticity, integrity, and delivery of information …

A typical blockchain protocol uses consensus to make sure that mutually mistrusting users
agree on the order in which their operations on shared data are executed. However, it is …