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 show the existence of indistinguishability obfuscators (iO) for general circuits assuming
subexponential security of:(a) the Learning with Errors (LWE) assumption (with …

We define a notion of semantic security of multilinear (aka graded) encoding schemes,
which stipulates security of a class of algebraic “decisional” assumptions: roughly speaking …

Abstract Goyal and Kumar (STOC'18) recently introduced the notion of non-malleable secret
sharing. Very roughly, the guarantee they seek is the following: the adversary may …

A program obfuscator takes a program and outputs a" scrambled" version of it, where the
goal is that the obfuscated program will not reveal much about its structure beyond what is …

In a recent work, Kumar, Meka, and Sahai (FOCS 2019) introduced the notion of bounded
collusion protocols (BCPs). BCPs are multiparty communication protocols in which N parties …

Secret sharing schemes allow a dealer to distribute a secret piece of information among
several parties such that only qualified subsets of parties can reconstruct the secret. The …

In this work, we consider the natural goal of designing secret sharing schemes that ensure
security against an adversary who may learn some “leaked''information about all the shares …

We propose a new cryptographic primitive called witness pseudorandom functions (witness
PRFs). Witness PRFs are related to witness encryption, but appear strictly stronger: we show …

We show by counter-example that the soundness security requirement for witness
encryption given by Garg, Gentry, Sahai and Waters (STOC 2013) does not suffice for the …