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 …

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

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 …

In this work, we study the question of what set of simple-to-state assumptions suffice for
constructing functional encryption and indistinguishability obfuscation (i O), supporting all …

Succinct non-interactive arguments (SNARGs) enable proofs of NP statements with very low
communication. Recently, there has been significant work in both theory and practice on …

Can a sender encode a pair of messages (m_0, m_1)(m 0, m 1) jointly, and send their
encoding over (say) a binary erasure channel, so that the receiver can decode exactly one …

We introduce the notion of pseudorandom obfuscation (PRO), a way to obfuscate (keyed)
pseudorandom functions $ f_K $ in an average-case sense. We introduce several variants of …

Privacy protection for smart contracts is currently inadequate. Existing solutions for privacy-
preserving smart contracts either support only a limited class of smart contracts or rely on …

We present a forward-secure public-key encryption (PKE) scheme without key update, ie
both public and private keys are immutable. In contrast, prior forward-secure PKE schemes …