Blockchain has found applications to track ownership of digital assets. Yet, several
blockchains were shown vulnerable to network attacks. It is thus crucial for companies to …

HoneyBadgerBFT, proposed by Miller et al.[34] as the first practical asynchronous atomic
broadcast protocol, demonstrated impressive performance. The core of HoneyBadgerBFT …

Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems
without a trusted third party and is a building block to decentralized protocols such as …

Consensus is a fundamental problem of distributed computing. While this problem has been
known to be unsolvable since 1985, existing protocols were designed these past three …

Asynchronous common subset (ACS) is a powerful paradigm enabling applications such as
Byzantine fault-tolerance (BFT) and multi-party computation (MPC). The most efficient ACS …

We provide a new protocol for Validated Asynchronous Byzantine Agreement in the
authenticated setting. Validated (multi-valued) Asynchronous Byzantine Agreement is a key …

This paper introduces a new leaderless Byzantine consensus called the Democratic
Byzantine Fault Tolerance (DBFT) for blockchains. While most blockchain consensus …

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 consensus is a fundamental building block in distributed cryptographic problems.
Despite decades of research, most existing asynchronous consensus protocols require a …

In this paper, we present the first Asynchronous Distributed Key Generation (ADKG)
algorithm which is also the first distributed key generation algorithm that can generate …