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 …

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 …

The well-known classical constructions of garbled circuits use four ciphertexts per gate,
although various methods have been proposed to reduce this cost. The best previously …

Private set intersection (PSI) allows two parties to compute the intersection of their sets
without revealing any information about items that are not in the intersection. It is one of the …

We design and develop ObliVM, a programming framework for secure computation. ObliVM
offers a domain specific language designed for compilation of programs into efficient …

We advocate schemes based on fixed-key AES as the best route to highly efficient circuit-
garbling. We provide such schemes making only one AES call per garbled-gate evaluation …

We propose a new approach to practical two-party computation secure against an active
adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT …

Query privacy in secure DBMS is an important feature, although rarely formally considered
outside the theoretical community. Because of the high overheads of guaranteeing privacy …

We describe a garbling scheme for boolean circuits, in which XOR gates are free and AND
gates require communication of 1.5 κ+ 5 1.5 κ+ 5 bits. This improves over the state-of-the-art …

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 …