Depth estimation and scene parsing are two particularly important tasks in visual scene
understanding. In this paper we tackle the problem of simultaneous depth estimation and …

In this work, we study indistinguishability obfuscation and functional encryption for general
circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C_0 …

Functional encryption is a modern public-key paradigm where a master secret key can be
used to derive sub-keys SK_F associated with certain functions F in such a way that the …

We introduce the problem of Multi-Input Functional Encryption, where a secret key sk f can
correspond to an n-ary function f that takes multiple ciphertexts as input. We formulate both …

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 …

The arrival of indistinguishability obfuscation (i O i O) has transformed the cryptographic
landscape by enabling several security goals that were previously beyond our reach …

Deciding “greater-than” relations among data items just given their encryptions is at the
heart of search algorithms on encrypted data, most notably, non-interactive binary search on …

We extend the reach of functional encryption schemes that are provably secure under
simple assumptions against unbounded collusion to include function-hiding inner product …

We propose the first construction for achieving adaptively secure functional encryption (FE)
for poly-sized circuits (without complexity leveraging) from indistinguishability obfuscation (i …

We consider the question of finding the lowest degree L for which L-linear maps suffice to
obtain IO. The current state of the art (Lin, EUROCRYPT'16, CRYPTO'17; Lin and …