Private information retrieval (PIR) is a key building block in many privacy-preserving
systems. Unfortunately, existing constructions remain very expensive. This paper introduces …

In this work, we show how to use indistinguishability obfuscation to build multiparty key
exchange, efficient broadcast encryption, and efficient traitor tracing. Our schemes enjoy …

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 …

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 …

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 …

Cloud storage services allow users to outsource their data to cloud servers to save local
data storage costs. However, unlike using local storage devices, users do not physically …

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

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

In this work, we present a new class of polynomial-time attacks on the original multilinear
maps of Garg, Gentry, and Halevi (2013). Previous polynomial-time attacks on GGH13 were …

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 …