The growth of the Internet has triggered tremendous opportunities for cooperative
computation, where people are jointly conducting computation tasks based on the private …

Most of our lives are conducted in the cyberspace. The human notion of privacy translates
into a cyber notion of privacy on many functions that take place in the cyberspace. This …

It is desirable to store data on data storage servers such as mail servers and file servers in
encrypted form to reduce security and privacy risks. But this usually implies that one has to …

We study the problem of searching on data that is encrypted using a public key system.
Consider user Bob who sends email to user Alice encrypted under Alice's public key. An …

A fully homomorphic encryption (FHE) scheme allows anyone to transform an encryption of
a message, m, into an encryption of any (efficient) function of that message, f(m), without …

We construct a simple fully homomorphic encryption scheme, using only elementary
modular arithmetic. We use Gentry's technique to construct a fully homomorphic scheme …

We present a somewhat homomorphic encryption scheme that is both very simple to
describe and analyze, and whose security (quantumly) reduces to the worst-case hardness …

We consider the problem of computing the intersection of private datasets of two parties,
where the datasets contain lists of elements taken from a large domain. This problem has …

We present SimplePIR, the fastest single-server private information retrieval scheme known
to date. SimplePIR's security holds under the learning-with-errors assumption. To answer a …

We efficiently combine unpredictability and verifiability by extending the Goldreich-
Goldwasser-Micali (1986) construction of pseudorandom functions f/sub s/from a secret …