In this work, we study what minimal sets of assumptions suffice for constructing
indistinguishability obfuscation (i O). We prove: Theorem (Informal): Assume sub …

We construct an indistinguishability obfuscation (IO) scheme from the sub-exponential
hardness of the decisional linear problem on bilinear groups together with two variants of …

We introduce a new cryptographic primitive called laconic function evaluation (LFE). Using
LFE, Alice can compress a large circuit f into a small digest. Bob can encrypt some data x …

The notion of multi-key fully homomorphic encryption (multi-key FHE)[López-Alt, Tromer,
Vaikuntanathan, STOC'12] was proposed as a generalization of fully homomorphic …

Motivated by the goal of designing versatile and flexible secure computation protocols that at
the same time require as little interaction as possible, we present new multiparty reusable …

A robust combiner combines many candidates for a cryptographic primitive and generates a
new candidate for the same primitive. Its correctness and security hold as long as one of the …

A central challenge in the study of MPC is to balance between security guarantees,
hardness assumptions, and resources required for the protocol. In this work, we study the …

We present a reusable two-round multi-party computation (MPC) protocol from the
Decisional Diffie Hellman assumption (DDH). In particular, we show how to upgrade any …

The bottleneck-complexity (BC) of secure multiparty computation (MPC) protocols is a
measure of the maximum number of bits which are sent and received by any party in a …

Functional encryption (FE) combiners allow one to combine many candidates for a
functional encryption scheme, possibly based on different computational assumptions, into …