We construct the first (key-policy) attribute-based encryption (ABE) system with short secret
keys: the size of keys in our system depends only on the depth of the policy circuit, not its …

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 …

We study the communication complexity of secure function evaluation (SFE). Consider a
setting where Alice has a short input χA, Bob has an input χB and we want Bob to learn …

A secret sharing scheme enables one party to distribute shares of a secret to n parties and
ensures that an adversary in control of t out of n parties will learn no information about the …

In this work, we introduce a novel technique for secure computation over large inputs.
Specifically, we provide a new oblivious transfer (OT) protocol with a laconic receiver …

Standard constructions of garbled circuits provide only static security, meaning the input x is
not allowed to depend on the garbled circuit F. But some applications—notably one-time …

We introduce and study the notion of non-interactive secure multiparty computation
(NIMPC). An NIMPC protocol for a function f (x 1,…, xn) is specified by a joint probability …

This paper provides a (standard-model) notion of security for (keyed) hash functions, called
UCE, that we show enables instantiation of random oracles (ROs) in a fairly broad and …

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 …

Protocols for secure two-party computation enable a pair of mistrusting parties to compute a
joint function of their private inputs without revealing anything but the output. One of the …