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 provide the first construction of a succinct non-interactive argument (SNARG) for all
polynomial time deterministic computations based on standard assumptions. For T steps of …

We construct a succinct non-interactive publicly-verifiable delegation scheme for any log-
space uniform circuit under the sub-exponential Learning With Errors (LWE) assumption. For …

We obtain publicly verifiable Succinct Non-Interactive Arguments (SNARGs) for arbitrary
deterministic computations and bounded space non-deterministic computation from …

We construct a delegation scheme for all polynomial time computations. Our scheme is
publicly verifiable and completely non-interactive in the common reference string (CRS) …

We investigate the best-possible (asymptotic) efficiency of functional encryption (FE) and
attribute-based encryption (ABE) by proving inherent space-time trade-offs and constructing …

We present an adaptive and non-interactive protocol for verifying arbitrary efficient
computations in fixed polynomial time. Our protocol is computationally sound and can be …

We present a new general framework for constructing compact and adaptively secure
attribute-based encryption (ABE) schemes from k-Lin in asymmetric bilinear pairing groups …

In the setting of cloud computing a user wishes to delegate its data, as well as computations
over this data, to a cloud provider. Each computation may read and modify the data, and …

For many cryptographic primitives, it is relatively easy to achieve selective security (where
the adversary commits a-priori to some of the choices to be made later in the attack) but …