The Capacity of Private Information Retrieval From Uncoded Storage Constrained Databases.

Private information retrieval (PIR) allows a user to retrieve a desired message from a set of databases without revealing the identity of the desired message. The replicated database scenario, where $N$ databases store each of the $K$ messages was considered by Sun and Jafar, and the optimal download cost was characterized as $\left ({1+ \frac {1}{N}+ \frac {1}{N^{2}}+ \cdots + \frac {1}{N^{K-1}}}\right)$. In this work, we consider the problem of PIR from uncoded storage constrained databases. Each database has a storage capacity of $\mu KL$ bits, where $L$ is the size of each message in bits, and $\mu \in [{1/N, 1}]$ is the normalized storage. The novel aspect of this work is to characterize the optimum download cost of PIR from uncoded storage constrained databases for any “normalized storage” value in the range $\mu \in [{1/N, 1}]$. In particular, for any $(N,K)$ , we show that the optimal trade-off between normalized storage, $\mu $ , and the download cost, $D(\mu)$ , is a piece-wise linear function given by the lower convex hull of the $N$ pairs $\left ({\frac {t}{N}, \left ({1+ \frac {1}{t}+ \frac {1}{t^{2}}+ \cdots + \frac {1}{t^{K-1}}}\right)}\right)$ for $t=1,2,\ldots, N$. To prove this result, we first present a storage constrained PIR scheme for any $(N,K)$. Next, we obtain a general lower bound on the download cost for PIR, which is valid for any arbitrary storage architecture. The uncoded storage assumption is then applied which allows us to express the lower bound as a linear program (LP). Finally, we solve the LP to obtain tight lower bounds on the download cost for different regimes of storage, which match the proposed storage constrained PIR scheme. [ABSTRACT FROM AUTHOR]