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

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 …

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 …

An urgent demand of deploying BFT consensus (eg, atomic broadcast) over the Internet is
raised for implementing (permissioned) blockchain services. The deterministic synchronous …

Protocols for Byzantine agreement (BA) and secure multi-party computation (MPC) can be
classified according to the underlying communication model. The two most commonly …

Verifiable secret sharing (VSS) is an important primitive in distributed cryptography that
allows a dealer to share a secret among n parties in the presence of an adversary …

Typically, protocols for Byzantine agreement (BA) are designed to run in either a
synchronous network (where all messages are guaranteed to be delivered within some …

In the problem of byzantine agreement (BA), a set of n parties wishes to agree on a value v
by jointly running a distributed protocol. The protocol is deemed secure if it achieves this …

Verifiable secret sharing (VSS) is a vital primitive in secure distributed computing. It allows
an untrusted dealer to verifiably share a secret among n parties in the presence of an …

Abstract Secure Multi-Party Computation (MPC) providing information-theoretic security
allows a set of n parties to securely compute an agreed function over a finite field, even if t …