Today, enterprises collect large amounts of data and leverage the cloud to perform analytics
over this data. Since the data is often sensitive, enterprises would prefer to keep it …

Motivated by the problem of avoiding duplication in storage systems, Bellare, Keelveedhi,
and Ristenpart have recently put forward the notion of Message-Locked Encryption (MLE) …

We put forward a new notion, function privacy, in identity-based encryption and, more
generally, in functional encryption. Intuitively, our notion asks that decryption keys reveal …

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 …

Non-malleable codes, defined by Dziembowski, Pietrzak, and Wichs (ICS'10), provide
roughly the following guarantee: if a codeword c encoding some message x is tampered to …

This paper provides the first efficient, standard-model, fully-secure schemes for some related
and challenging forms of public-key encryption (PKE), namely deterministic and hedged …

This paper addresses deterministic public-key encryption schemes (DE), which are
designed to provide meaningful security when only source of randomness in the encryption …

Selective opening (SO) security refers to adversaries that receive a number of ciphertexts
and, after having corrupted a subset of the senders (thus obtaining the plaintexts and the …

We give a definitional framework for point-function obfuscation in which security is
parameterized by a class of algorithms we call target generators. Existing and new notions …

In distributed pseudorandom functions (DPRFs), a PRF secret key SK is secret shared
among N servers so that each server can locally compute a partial evaluation of the PRF on …