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 …

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 …

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

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 …

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 …

In this paper we introduce the notion of lockable obfuscation. In a lockable obfuscation
scheme there exists an obfuscation algorithm Obf that takes as input a security parameter, a …

We carry out a systematic study of the GGH15 graded encoding scheme used with general
branching programs. This is motivated by the fact that general branching programs are more …

In this work we provide a traitor tracing construction with ciphertexts that grow polynomially
in log (n) where n is the number of users and prove it secure under the Learning with Errors …

Abstract Candidates of Indistinguishability Obfuscation (iO) can be categorized as “direct” or
“bootstrap** based”. Direct constructions rely on high degree multilinear maps 28, 29 and …

We describe new cryptanalytic attacks on the candidate branching program obfuscator
proposed by Garg, Gentry, Halevi, Raykova, Sahai and Waters (GGHRSW) using the …