Consensus is arguably one of the most fundamental problems in distributed computing,
playing also an important role in the area of cryptographic protocols as the enabler of a …

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

Game-based proofs are a well-established paradigm for structuring security arguments and
simplifying their understanding. We present a novel framework, CryptHOL, for rigorous game …

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 …

Broadcast is an essential primitive for secure computation. We focus in this paper on optimal
resilience (ie, when the number of corrupted parties t is less than a third of the computing …

We construct a four round secure multip arty computation (MPC) protocol in the plain model
that achieves security against any dishonest majority. The security of our protocol relies only …

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

Approximate Agreement (AA) allows a set of n parties that start with real-valued inputs to
obtain values that are at most within a parameter ε> 0 from each other and within the range …

Typical results in multi-party computation (in short, MPC) capture faulty parties by assuming
a threshold adversary corrupting parties actively and/or fail-corrupting. These corruption …

Abstract Although Byzantine Agreement (BA) has been studied for three decades, perhaps
somewhat surprisingly, there still exist significant gaps in our understanding regarding its …