Protocols for secure multiparty computation enable a set of parties to compute a function of
their inputs without revealing anything but the output. The security properties of the protocol …

A zk-SNARK is a powerful cryptographic primitive that provides a succinct and efficiently
checkable argument that the prover has a witness to a public NP statement, without …

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 …

A decade of active research has led to practical constructions of zero-knowledge succinct
non-interactive arguments of knowledge (zk-SNARKs) that are now being used in a wide …

We study the communication complexity of unconditionally secure MPC with guaranteed
output delivery over point-to-point channels for corruption threshold t< n/2, assuming the …

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

Protocols for secure multiparty computation enable a set of parties to compute a function of
their inputs without revealing anything but the output. The security properties of the protocol …

Existing approaches to secure multiparty computation (MPC) require all participants to
commit to the entire duration of the protocol. As interest in MPC continues to grow, it is …

In the last few years, the efficiency of secure multi-party computation (MPC) in the dishonest
majority setting has increased by several orders of magnitudes starting with the SPDZ …

Secure multi-party computation (MPC) is a central cryptographic task that allows a set of
mutually distrustful parties to jointly compute some function of their private inputs where …