We construct a general multiparty computation (MPC) protocol with only two rounds of
interaction in the common random string model, which is known to be optimal. In the honest …

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 …

Functional encryption is a modern public-key paradigm where a master secret key can be
used to derive sub-keys SK_F associated with certain functions F in such a way that the …

Fully homomorphic encryption (FHE) enables secure computation over the encrypted data of
a single party. We explore how to extend this to multiple parties, using threshold fully …

Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to
almost any known cryptographic object. Prior candidate IO constructions were based on …

The arrival of indistinguishability obfuscation (i O i O) has transformed the cryptographic
landscape by enabling several security goals that were previously beyond our reach …

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 …

We construct functional encryption schemes for polynomial-time computable functions
secure against an a-priori bounded polynomial number of collusions. Our constructions …

We provide new two-round multiparty secure computation (MPC) protocols in the dishonest
majority setting assuming the minimal assumption that two-round oblivious transfer (OT) …

We study the parallel time-complexity of basic cryptographic primitives such as one-way
functions (OWFs) and pseudorandom generators (PRGs). Specifically, we study the …