Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to
almost any known cryptographic object. Prior candidate IO constructions were based on …

This book is a revised version of my Doctoral Dissertation, which was completed at the
Massachusetts Institute of Technology in November, 1988. The main purpose of the work …

Abstract Under the Decisional Diffie-Hellman (DDH) assumption, we present a 2-out-of-2
secret sharing scheme that supports a compact evaluation of branching programs on the …

A functional commitment scheme enables a user to concisely commit to a function from a
specified family, then later concisely and verifiably reveal values of the function at desired …

In this paper we introduce the notion of lockable obfuscation. In a lockable obfuscation
scheme there exists an obfuscation algorithm Obf that takes as input a security parameter, a …

Witness encryption is a generalization of public-key encryption where the public key can be
any NP statement x and the associated decryption key is any witness w for x. While early …

We consider the range avoidance problem (called Avoid): given the description of a circuit
with more output gates than input gates, find a string that is not in the range of the circuit …

Time-release cryptography requires problems that take a long time to solve and take just as
long even with significant computational resources. While time-release cryptography …

Universal circuits (UCs) can be programmed to evaluate any circuit of a given size k. They
provide elegant solutions in various application scenarios, eg for private function evaluation …

Functional encryption lies at the frontiers of the current research in cryptography; some
variants have been shown sufficiently powerful to yield indistinguishability obfuscation (IO) …