Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn
as the foundation for secure cryptographic systems. Attractive features of lattice cryptography …

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 develop a general approach to adding a threshold functionality to a large class of (non-
threshold) cryptographic schemes. A threshold functionality enables a secret key to be split …

Vector commitment schemes allow a user to commit to a vector of values x∈{0, 1} ℓ and
later, open up the commitment to a specific set of positions. Both the size of the commitment …

We construct an indistinguishability obfuscation (IO) scheme for all polynomial-size circuits
from constant-degree graded encoding schemes, assuming the existence of a …

We construct an LWE-based key-policy attribute-based encryption (ABE) scheme that
supports attributes of unbounded polynomial length. Namely, the size of the public …

A functional commitment allows a user to commit to an input x∈{0, 1} ℓ and later open up the
commitment to a value y= f (x) with respect to some function f. In this work, we focus on …

Cryptographic group actions are a relaxation of standard cryptographic groups that have
less structure. This lack of structure allows them to be plausibly quantum resistant despite …

A watermarking scheme for programs embeds some information called a mark into a
program while preserving its functionality. No adversary can remove the mark without …

Abstract Constraint-hiding constrained PRFs (CHCPRFs), initially studied by Boneh, Lewi
and Wu (PKC 2017), are constrained PRFs where the constrained key hides the description …