Secure Multi-Party Computation (MPC) allows mutually distrusting parties to run joint
computations without revealing private data. Current MPC algorithms scale poorly with data …

As Byzantine Agreement (BA) protocols find application in large-scale decentralized
cryptocurrencies, an increasingly important problem is to design BA protocols with improved …

Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree
on a message from a designated sender, even if some processes (including the sender) are …

One of the most successful applications of peer-to-peer communication networks is in the
context of blockchain protocols, which-in Satoshi Nakamoto's own words-rely on the" nature …

Zero knowledge proofs are one of the most influential concepts in theoretical computer
science. In the seminal definition due to Goldwasser, Micali and Rackoff dating back to the …

We present a theoretical framework for analyzing the efficiency of consensus protocols, and
apply it to analyze the optimistic and pessimistic confirmation times of state-of-the-art …

Byzantine agreement (BA), the task of n parties to agree on one of their input bits in the face
of malicious agents, is a powerful primitive that lies at the core of a vast range of distributed …

Secure multi-party computation (MPC) allows multiple parties to perform secure joint
computations on their private inputs. Today, applications for MPC are growing with …

Many decentralized systems rely on flooding protocols for message dissemination. In such a
protocol, the sender of a message sends it to a randomly selected set of peers. These peers …

Messages in large-scale networks such as blockchain systems are typically disseminated
using flooding protocols, in which parties send the message to a random set of peers until it …