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 …

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 …

The problem of private information retrieval (PIR) gets renewed attentions in recent years
due to its information-theoretic reformulation and applications in distributed storage systems …

In this paper, we study two families of codes with availability, namely, private information
retrieval (FIR) codes and batch codes. While the former requires that every information …

Private information retrieval (PIR) schemes for coded storage with colluding servers are
presented, which are not restricted to maximum distance separable (MDS) codes. PIR …

The capacity of private information retrieval (PIR) from databases coded using maximum
distance separable (MDS) codes was previously characterized by Banawan and Ulukus …

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

We consider the storage-retrieval rate tradeoff in private information retrieval systems using
a Shannon-theoretic approach. Our focus is on the canonical two-message two-database …

In the classical model for (information theoretically secure) Private Information Retrieval
(PIR) due to Chor, Goldreich, Kushilevitz and Sudan, a user wishes to retrieve one bit of a …

We study array codes which are based on subspaces of a linear space over a finite field,
using spreads, q-Steiner systems, and subspace transversal designs. We present several …