We describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups, and show an example application of such… Expand

This work gives constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits and describes a candidate construction for blurry obfuscation for $\mathbf{NC}^1$ circuits.Expand

This work gives constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits and shows how to use them together with Fully Homomorphic Encryption to achieve functional encryption for all circuits.Expand

The method for witness encryption is introduced and formally defined, which yields the first candidate construction for an open problem posed by Rudich in 1989: constructing computational secret sharing schemes for an NP-complete access structure.Expand

An asymptotically efficient oblivious RAM ORAM protocol providing oblivious access read and write of a memory index y in exactly two rounds that gives rise to a 4-round symmetric searchable encryption scheme where search is sublinear in the worst case and the search pattern is not leaked.Expand

A simplified variant of this compiler is described, and it is proved that it is a virtual black box obfuscator in a generic multilinear map model under the learning with errors (LWE) hardness assumption.Expand

A new iO candidate is given which can be seen as a small modification or generalization of the original candidate of Garg, Gentry, Halevi, Raykova, Sahai, and Waters FOCS'13, and its security is proved in the weak multilinear map model, thus giving the first iO candidates that is provably secure against all known polynomial-time attacks on GGH13.Expand

New, efficient trace & revoke schemes which are based on prime order bilinear groups, and whose security depend on the hardness of the Decisional Linear Assumption or the External Diffie-Hellman (XDH) assumption are presented.Expand

TWORAM is presented, the first fully-secure searchable symmetric encryption scheme where search is sublinear and search pattern is not leaked—access pattern can also be concealed if the authors assume the documents are stored in the obliviously accessed memory M.Expand

This paper defines the notion of a differing-input obfuscator for Turing machines and give a construction for the same (without converting it to a circuit) with input-specific running times, and gives a functional encryption scheme that allows for secret-keys to be associated with Turing machines, and thereby achieves input- specific running times.Expand