Important decisions about people are increasingly made by algorithms: Votes are counted;
voter rolls are purged; financial aid decisions are made; taxpayers are chosen for audits; air …

Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s
to a tool for building real systems today. Over the past decade, MPC has been one of the …

Garbled circuits, a classical idea rooted in the work of Yao, have long been understood as a
cryptographic technique, not a cryptographic goal. Here we cull out a primitive …

Secure multi-party computation has been considered by the cryptographic community for a
number of years. Until recently it has been a purely theoretical area, with few …

We present a simple and efficient compiler for transforming secure multi-party computation
(MPC) protocols that enjoy security only with an honest majority into MPC protocols that …

Sensitive personal data are created in many application domains, and there is now an
increasing demand to share, integrate, and link such data within and across organisations in …

We study a model of incentivizing correct computations in a variety of cryptographic tasks.
For each of these tasks we propose a formal model and design protocols satisfying our …

Protocols for secure two-party computation enable a pair of parties to compute a function of
their inputs while preserving security properties such as privacy, correctness and …

Abstract We consider generic Garbled Circuit (GC)-based techniques for Secure Function
Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for …

The goal of this paper is to assess the feasibility of two-party secure computation in the
presence of a malicious adversary. Prior work has shown the feasibility of billion-gate …