In the private information retrieval (PIR) problem, a user wishes to retrieve, as efficiently as
possible, one out of K messages from N non-communicating databases (each holds all K …

We construct a sublinear-time single-server preprocessing Private Information Retrieval
(PIR) scheme with an optimal tradeoff between client storage and server computation (up to …

Function Secret Sharing (FSS), introduced by Boyle et al.(Eurocrypt 2015), provides a way
for additively secret-sharing a function from a given function family F. More concretely, an m …

Motivated by the goal of securely searching and updating distributed data, we introduce and
study the notion of function secret sharing (FSS). This new notion is a natural generalization …

Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one
out of K messages from N non-communicating replicated databases (each holds all K …

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 …

The problem of providing privacy, in the private information retrieval (PIR) sense, to users
requesting data from a distributed storage system (DSS), is considered. The DSS is coded …

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 …

This paper presents Checklist, a system for private blocklist lookups. In Checklist, a client
can determine whether a particular string appears on a server-held blocklist of strings …

We study the problem of Private Information Retrieval (PIR) in the presence of prior side
information. The problem setup includes a database of K independent messages possibly …