This paper introduces Flamingo, a system for secure aggregation of data across a large set
of clients. In secure aggregation, a server sums up the private inputs of clients and obtains …

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 common subset (ACS) is a powerful paradigm enabling applications such as
Byzantine fault-tolerance (BFT) and multi-party computation (MPC). The most efficient ACS …

Threshold signatures are a crucial tool for many distributed protocols. As shown by Cachin,
Kursawe, and Shoup (PODC'00), schemes with unique signatures are of particular …

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 …

Byzantine consensus is a fundamental building block in distributed cryptographic problems.
Despite decades of research, most existing asynchronous consensus protocols require a …

We give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally
resilient (can withstand f< n over 3 faulty parties), has a constant expected number of …

Recently, increasing personal data has been stored in blockchain databases, ensuring data
integrity by consensus. Although transparent and immutable blockchains are mainly …

The classic asynchronous Byzantine fault tolerance (BFT) framework of Ben-Or, Kemler, and
Rabin (BKR) and its descendants rely on reliable broadcast (RBC) and asynchronous binary …