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 …

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 consider the problem of single-round private information retrieval (PIR) from N replicated
databases. We consider the case when B databases are outdated (unsynchronized), or …

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 consider the problem of multi-message private information retrieval (MPIR) from N non-
communicating replicated databases. In MPIR, the user is interested in retrieving P …

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 consider the problem of private information retrieval (PIR) from N non-colluding and
replicated databases when the user is equipped with a cache that holds an uncoded fraction …