In this work, we study indistinguishability obfuscation and functional encryption for general
circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C_0 …

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

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 …

In an order-preserving encryption scheme, the encryption algorithm produces ciphertexts
that preserve the order of their plaintexts. Order-preserving encryption schemes have been …

Two recent works [Lin, EUROCRYPT 2016, Lin and Vaikuntanathan, FOCS 2016] showed
how to construct Indistinguishability Obfuscation (IO) from constant degree multilinear maps …

We extend the recent zeroizing attacks of Cheon, Han, Lee, Ryu and Stehlé (Eurocrypt'15)
on multilinear maps to settings where no encodings of zero below the maximal level are …

All constructions of general purpose indistinguishability obfuscation (IO) rely on either meta-
assumptions that encapsulate an exponential family of assumptions (eg, Pass, Seth and …

We consider the question of finding the lowest degree L for which L-linear maps suffice to
obtain IO. The current state of the art (Lin, EUROCRYPT'16, CRYPTO'17; Lin and …

We construct an indistinguishability obfuscation (IO) scheme for all polynomial-size circuits
from constant-degree graded encoding schemes, assuming the existence of a …