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 …

The problem of weakly-private information retrieval (WPIR) is to allow the user to retrieve
one out of K messages from a set of N distributed servers while guaranteeing that the …

We study the problem of weakly private information retrieval (PIR) when there is
heterogeneity in servers' trustfulness under the maximal leakage (Max-L) metric. A user …

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 …

We study the problem of weakly private information retrieval (PIR) when there is
heterogeneity in servers' trustfulness under the maximal leakage (Max-L) metric and mutual …

Originating from the construction of the asymptotic-capacity achieving scheme for X-secure T-
private information retrieval (XSTPIR), the technique of cross-subspace alignment (CSA) …

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