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 …

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 consider the problem of private information retrieval (PIR) over a distributed storage
system. The storage system consists of N non-colluding databases, each storing an MDS …

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 present a general framework for private information retrieval (PIR) from arbitrary coded
databases that allows one to adjust the rate of the scheme to the suspected number of …

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 …

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 …

We propose a new capacity-achieving code for the private information retrieval (PIR)
problem, and show that it has the minimum message size (being one less than the number …

We propose three private information retrieval (PIR) protocols for distributed storage systems
(DSSs), where data is stored using an arbitrary linear code. The first two protocols, named …

Private information retrieval (PIR) protocols allow a user to retrieve a data item from a
database without revealing any information about the identity of the item being retrieved …