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

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 …

We consider information leakage to the user in private information retrieval (PIR) systems.
Information leakage can be measured in terms of individual message leakage or total …

Information-theoretic formulations of the private information retrieval (PIR) problem have
been investigated under a variety of scenarios. Symmetric private information retrieval …

Quantum private information retrieval (QPIR) is a protocol in which a user retrieves one of
multiple files from n non-communicating servers by downloading quantum systems without …

We study the capacity of quantum private information retrieval (QPIR) with multiple servers.
In the QPIR problem with multiple servers, a user retrieves a classical file by downloading …

We study the private information retrieval (PIR) problem under arbitrary collusion patterns for
replicated databases. We find a general characterization of the PIR capacity, which is the …