An ideal permissionless consensus protocol would, in addition to satisfying standard
consistency and liveness guarantees, render consistency violations prohibitively expensive …

The Byzantine consensus problem involves n processes, out of which t< n could be faulty
and behave arbitrarily. Three properties characterize consensus:(1) termination, requiring …

In a non-synchronous system with n processes, no t 0-resilient (deterministic or probabilistic)
Byzantine consensus protocol can prevent a disagreement among correct processes if the …

The widely used Signal protocol provides protection against state exposure attacks through
forward security (protecting past messages) and post-compromise security (for restoring …

This book is primarily dedicated to (i) engineers who want to refine their distributed
computing expertise and take informed design decisions that can impact the security and …

It is well known that a trusted setup allows one to solve the Byzantine agreement problem in
the presence of $ t< n/2$ corruptions, bypassing the setup-free $ t< n/3$ barrier. Alas, the …

This paper studies the problem of verifying linearizability at runtime, where one seeks for a
concurrent algorithm for verifying that the current execution of a given concurrent shared …

In this paper, we introduce Rorqual, a protocol designed to enhance the performance of the
Narwhal Mempool by integrating Trusted Execution Environments (TEEs). Both Narwhal and …

Auditability allows to track all the read operations performed on a register. It abstracts the
need of data owners to control access to their data, tracking who read which information …

State machine replication (SMR) allows nodes to jointly maintain a consistent ledger, even
when a part of nodes are Byzantine. To defend against and/or limit the impact of attacks …