Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …

We present a new, simple candidate construction of indistinguishability obfuscation (iO). Our
scheme is inspired by lattices and learning-with-errors (LWE) techniques, but we are unable …

Big data drive multidimensional convergence and profound innovations among industries
and provide novel ways of exploring the world. As they significantly create economic and …

We show the existence of indistinguishability obfuscators (iO) for general circuits assuming
subexponential security of:(a) the Learning with Errors (LWE) assumption (with …

Witness encryption (WE), first introduced by Garg, Gentry, Sahai and Waters in, is an
encryption scheme where messages are encrypted with respect to instances of an NP …

Witness encryption (WE) allows us to use an arbitrary NP statement x as a public key to
encrypt a message, and the witness w serves as a decryption key. Security ensures that …

We construct indistinguishability obfuscation (iO) solely under circular-security properties of
encryption schemes based on the Learning with Errors (LWE) problem. Circular-security …

We present a new, simple candidate broadcast encryption scheme for N users with
parameter size poly (log N). We prove security of our scheme under a non-standard variant …

Abstract Boneh, Waters and Zhandry (CRYPTO 2014) used multilinear maps to provide a
solution to the long-standing problem of public-key broadcast encryption (BE) where all …

We propose a new approach to construct general-purpose indistinguishability obfuscation
(iO). Our construction is obtained via a new intermediate primitive that we call split fully …