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

parties to securely compute an agreed function f over some finite field in the presence of a
computationally unbounded adversary, who can maliciously corrupt any t out of the n …

Proof-of-work (PoW) is an algorithmic tool used to secure networks by imposing a
computational cost on participating devices. Unfortunately, traditional PoW schemes require …

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

Traditional protocols for secure multi-party computation among n parties communicate at
least a linear (in n) number of bits, even when computing very simple functions. In this work …

Tor is a tool for Internet privacy with millions of daily users. The Tor system benefits in many
ways from information gathered about the operation of its network. Measurements guide …

Designing efficient distributed protocols for various agreement tasks such as Byzantine
Agreement, Broadcast, and Committee Election is a fundamental problem. We are interested …

Secure multi-party computation (MPC) allows multiple parties to compute a known function
over inputs held by each party, without any party having to reveal its private input …

We present a secure asynchronous multiparty computation (AMPC) protocol with optimal
resilience, involving n= 3t+ 1 parties and tolerating a computationally bounded static …

In this work, we initiate the study of bottleneck complexity as a new communication efficiency
measure for secure multiparty computation (MPC). Roughly, the bottleneck complexity of an …