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 …

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 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 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 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 T-Private Information Retrieval with private side information
(TPIR-PSI). In this problem, N replicated databases store K independent messages, and a …

X-secure and T-private information retrieval (XSTPIR) is a form of private information
retrieval where data security is guaranteed against collusion among up to X servers and the …

We introduce the problem of private computation, comprised of N distributed and non-
colluding servers, K independent datasets, and a user who wants to compute a function of …

Caching is an efficient way to reduce network traffic congestion during peak hours by storing
some content at the user's local cache memory without knowledge of later demands. For the …

We consider the problem of symmetric private information retrieval (SPIR) with user-side
common randomness. In SPIR, a user retrieves a message out of messages from non …