When two or more parties need to compute a common result while safeguarding their
sensitive inputs, they use secure multiparty computation (SMC) techniques such as garbled …

Blockchains are gaining traction and acceptance, not just for cryptocurrencies, but
increasingly as an architecture for distributed computing. In this work we seek solutions that …

Secure multi-party computation (MPC) allows a set of parties to jointly compute a function on
their private inputs, and reveals nothing but the output of the function. In the last decade …

The inherent difficulty of maintaining stateful environments over long periods of time gave
rise to the paradigm of serverless computing, where mostly stateless components are …

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 …

We present a novel approach to honest majority secure multiparty computation in the
preprocessing model with information theoretic security that achieves the best online …

In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to n
verifiers at a time efficiently. The proofs are secure against the collusion of a prover and a …

The best known n party unconditional multiparty computation protocols with an optimal
corruption threshold communicates O (n) field elements per gate. This has been the case …

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

A central challenge in the study of MPC is to balance between security guarantees,
hardness assumptions, and resources required for the protocol. In this work, we study the …