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 introduce the SPIRAL family of single-server private information retrieval (PIR) protocols.
SPIRAL relies on a composition of two lattice-based homomorphic encryption schemes: the …

We construct new private-information-retrieval protocols in the single-server setting. Our
schemes allow a client to privately fetch a sequence of database records from a server …

This paper introduces protocols for authenticated private information retrieval. These
schemes enable a client to fetch a record from a remote database server such that (a) the …

We show how to generically improve the succinctness of non-interactive publicly verifiable
batch argument (BARG) systems. In particular, we show (under a mild additional …

We provide the first constructions of SNARGs for Batch-NP and P based solely on the sub-
exponential Decisional Diffie Hellman (DDH) assumption. Our schemes achieve poly …

We describe a simple method for solving the distributed discrete logarithm problem in
Paillier groups, allowing two parties to locally convert multiplicative shares of a secret (in the …

We present the first protocols for private information retrieval that allow fast (sublinear-time)
database lookups without increasing the server-side storage requirements. To achieve …

We present a rate-1 construction of a publicly verifiable non-interactive argument system for
batch-NP (also called a BARG), under the LWE assumption. Namely, a proof corresponding …

Homomorphic encryption (HE) is often viewed as impractical, both in communication and
computation. Here we provide an additively homomorphic encryption scheme based on …