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 …

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 …

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) 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 …

Registered encryption (Garg et al., TCC'18) is an emerging paradigm that tackles the key-
escrow problem associated with identity-based encryption by replacing the private-key …

Indistinguishability Obfuscation (i O) is a highly versatile primitive implying a myriad
advanced cryptographic applications. Up until recently, the state of feasibility of i O was …