A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems

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 case, for which a coding scheme based on random codebook generation, joint typicality encoding, and the binning technique is proposed. It is first shown that when the retrieval rate is kept optimal, the proposed non-linear scheme uses less storage than the optimal linear scheme. Since the other extreme point corresponding to using the minimum storage requires both messages to be retrieved, the performance through space-sharing of the two points can also be achieved. However, using the proposed scheme, further improvement can be achieved over this simple strategy. Although the random-coding based scheme has a diminishing but nonzero probability of error, the coding error can be eliminated if variable-length codes are allowed. Novel outer bounds are finally provided and used to establish the superiority of the non-linear codes over linear codes.

[1]  Ravi Tandon,et al.  Private Information Retrieval from Storage Constrained Databases - Coded Caching meets PIR , 2017, ArXiv.

[2]  Hsuan-Yin Lin,et al.  Lengthening and Extending Binary Private Information Retrieval Codes , 2017, ArXiv.

[3]  Xin Wang,et al.  On Private Information Retrieval Array Codes , 2016, IEEE Transactions on Information Theory.

[4]  Eitan Yaakobi,et al.  Nearly optimal constructions of PIR and batch codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[5]  Hua Sun,et al.  The Capacity of Private Information Retrieval , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[6]  Oliver W. Gnilke,et al.  Private Information Retrieval From MDS Coded Data in Distributed Storage Systems , 2018, IEEE Transactions on Information Theory.

[7]  Alexander Vardy,et al.  Lower Bound on the Redundancy of PIR Codes , 2016, ArXiv.

[8]  Tuvi Etzion,et al.  PIR Array Codes with Optimal PIR Rate , 2016, ArXiv.

[9]  Sennur Ulukus,et al.  Private information retrieval from coded databases , 2017, 2017 IEEE International Conference on Communications (ICC).

[10]  Hua Sun,et al.  Multiround Private Information Retrieval: Capacity and Storage Overhead , 2016, IEEE Transactions on Information Theory.

[11]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[12]  Vinayak Ramkumar,et al.  Binary, shortened projective reed muller codes for coded private information retrieva , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[13]  Kannan Ramchandran,et al.  One extra bit of download ensures perfectly private information retrieval , 2014, 2014 IEEE International Symposium on Information Theory.

[14]  Hirosuke Yamamoto,et al.  Private information retrieval for coded storage , 2014, 2015 IEEE International Symposium on Information Theory (ISIT).

[15]  Tuvi Etzion,et al.  PIR array codes with optimal PIR rates , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[16]  Eitan Yaakobi,et al.  Codes for distributed PIR with low storage overhead , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[17]  Andrea Sgarro,et al.  Source coding with side information at several decoders , 1977, IEEE Trans. Inf. Theory.