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 …

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 …

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 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 …

The problem of cache enabled private information retrieval (PIR) is considered in which a
user wishes to privately retrieve one out of K messages, each of size L bits from N distributed …

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 …

We consider the problem of T-Private Information Retrieval with private side information
(TPIR-PSI). In this problem, N replicated databases store K independent messages, and a …

The goal of coded distributed computation is to efficiently distribute a computation task, such
as matrix multiplication, N-linear computation, or multivariate polynomial evaluation, across …