Secure two-party and multiparty computation has long stood at the center of the foundations
of theoretical cryptography. Recently, however, interest has grown regarding the efficiency of …

In the setting of secure multiparty computation (MPC), a set of mutually distrusting parties
wish to jointly compute a function, while guaranteeing the privacy of their inputs and the …

Consider several parties that do not trust each other, yet they wish to correctly compute
some common function of their local inputs while keeping these inputs private. This problem …

This paper is a preliminary exploration of secure distributed human computation. We
consider the general paradigm of using large-scale distributed computation to solve difficult …

Discrete exponential operation, such as modular exponentiation and scalar multiplication on
elliptic curves, is a basic operation of many public-key cryptosystems. However, the …

Yao's circuit garbling scheme is one of the basic building blocks of cryptographic protocol
design. Originally designed to enable two-message, two-party secure computation, the …

In the setting of multiparty computation, a set of parties wish to jointly compute a function of
their inputs, while preserving security in the case that some subset of them are corrupted …

A major challenge in the study of cryptography is characterizing the necessary and sufficient
assumptions required to carry out a given cryptographic task. The focus of this work is the …

We revisit the framework of Commodity-based Cryptography presented by Beaver
(STOC'97) with a focus on updating the framework to fit with modern multiparty computation …

Already in ancient Greece, the Spartans were worried about the privacy of their messages
during military conflicts and used a transposition cipher (scytale) to render their messages …