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 consider constructing capacity-achieving linear codes with minimum message size for
private information retrieval (PIR) from N non-colluding databases, where each message is …

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 …

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 …

A private information retrieval (PIR) protocol guarantees that a user can privately retrieve
files stored in a database without revealing any information about the identity of the …

We study the symmetric private information retrieval (SPIR) problem under arbitrary
collusion and eavesdropping patterns for replicated databases. We find its capacity, which is …

In the canonical private information retrieval (PIR) problem, a user retrieves a message from
a set of databases without allowing any individual database to obtain any knowledge …

We study the problem of weakly private information retrieval (W-PIR), where a user wishes to
retrieve a desired message from N non-colluding servers in a way that the privacy leakage …

Private information retrieval protocols guarantee that a user can privately and losslessly
retrieve a single file from a database stored across multiple servers. In this work, we propose …