Sharding is the prevalent approach to breaking the trilemma of simultaneously achieving
decentralization, security, and scalability in traditional blockchain systems, which are …

Despite recent progresses of practical asynchronous Byzantine-fault tolerant (BFT)
consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly …

Existing committee-based Byzantine state machine replication (SMR) protocols, typically
deployed in production blockchains, face a clear trade-off:(1) they either achieve linear …

Asynchronous BFT consensus can implement robust mission-critical decentralized services
in the unstable or even adversarial wide-area network without relying on any form of timing …

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 …

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 …

Public randomness is a fundamental component in many cryptographic protocols and
distributed systems and often plays a crucial role in ensuring their security, fairness, and …