Multi-valued validated asynchronous Byzantine agreement (MVBA), proposed in the elegant
work of Cachin et al.(CRYPTO'01), is fundamental for critical fault-tolerant services such as …

In this paper, we introduce the problem of Asynchronous Data Dissemination (ADD).
Intuitively, an ADD protocol disseminates a message to all honest nodes in an …

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 …

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

An accumulator is a cryptographic primitive that allows a prover to succinctly commit to a set
of values while being able to provide proofs of (non-) membership. A batch proof is an …

We describe robust high-throughput threshold protocols for generating Schnorr signatures in
an asynchronous setting with potentially hundreds of parties. The protocols run a single …

Efficient asynchronous Byzantine agreement (BA) protocols were mostly studied with private
setups, eg, pre-setup threshold cryptosystem. Challenges remain to reduce the large …

This work focuses on the parallel broadcast primitive, where each of the $ n $ parties wish to
broadcast their $\ell $-bit input in parallel. We consider the authenticated model with PKI and …

Byzantine Agreement (BA) is one of the most fundamental problems in distributed
computing, and its communication complexity is an important efficiency metric. It is well …

Distributed key generation (DKG) protocols are an essential building block for threshold
cryptosystems. Many DKG protocols tolerate up to ts< n/2 corruptions assuming a well …