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 …

Secret sharing is an essential tool for many distributed applications, including distributed key
generation and multiparty computation. For many practical applications, we would like to …

To reduce latency and communication overhead of asynchronous Byzantine Fault Tolerance
(BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art …

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 …

Byzantine agreement allows n processes to decide on a common value, in spite of arbitrary
failures. The seminal Dolev-Reischuk bound states that any deterministic solution to …

With the emergence of decentralized systems, spearheaded by blockchains, threshold
cryptography has seen unprecedented adoption. Just recently, the trustless distribution of …

We study network-agnostic secure multi-party computation (MPC) in the presence of
computationally-bounded adversaries. A network-agnostic protocol provides the best …

Convex Consensus (CC) allows a set of parties to agree on a value v inside the convex hull
of their inputs with respect to a predefined abstract convexity notion, even in the presence of …

Asynchronous common subset (ACS) is an essential building block for Byzantine fault-
tolerance and multi-party computation. The classic ACS framework is due to Ben-Or, Kemler …

In this work, we initiate the study of network-agnostic perfectly-secure multi-party
computation (MPC) against general (non-threshold) adversaries, where the corruption …