Byzantine Fault-Tolerant (BFT) protocols cover a broad spectrum of design dimensions from
infrastructure settings, such as the communication topology, to more technical features, such …

This paper explores the good-case latency of Byzantine fault-tolerant broadcast, motivated
by the real-world latency and performance of practical state machine replication protocols …

An urgent demand of deploying BFT consensus (eg, atomic broadcast) over the Internet is
raised for implementing (permissioned) blockchain services. The deterministic synchronous …

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

Byzantine fault-tolerant (BFT) protocols allow a group of replicas to come to consensus even
when some of the replicas are Byzantine faulty. There exist multiple BFT protocols to …

A random beacon provides a continuous public source of randomness and its applications
range from public lotteries to zero-knowledge proofs. Existing random beacon protocols …

Classic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model,
most often one of the following: synchronous, asynchronous or partially synchronous. It is …

Abstract Directed Acyclic Graph (DAG) based BFT protocols balance consensus efforts
across different parties and maintain high throughput even when some designated parties …

We introduce Mysticeti-C a byzantine consensus protocol with low-latency and high
resource efficiency. It leverages a DAG based on Threshold Clocks and incorporates …

We present the Internet Computer Consensus (ICC) family of protocols for atomic broadcast
(aka, consensus), which underpin the Byzantine fault-tolerant replicated state machines of …