Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding

The capacity of private information retrieval (PIR) from databases coded using maximum distance separable (MDS) codes was previously characterized by Banawan and Ulukus, where it was assumed that the messages are encoded and stored separably in the databases. This assumption was also usually made in other related works in the literature, and this capacity is usually referred to as the MDS-PIR capacity colloquially. In this work, we considered the question of if and when this capacity barrier can be broken through joint encoding and storing of the messages. Our main results are two classes of novel code constructions, which allow joint encoding, as well as the corresponding PIR protocols, which indeed outperformed the separate MDS-coded systems. Moreover, we show that a simple, but novel expansion technique allows us to generalize these two classes of codes, resulting in a wider range of the cases where this capacity barrier can be broken.

[1]  Chao Tian,et al.  A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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

[3]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[4]  Mikael Skoglund,et al.  Symmetric private information retrieval for MDS coded distributed storage , 2016, 2017 IEEE International Conference on Communications (ICC).

[5]  Vitaly Skachek,et al.  Batch and PIR Codes and Their Connections to Locally-Repairable Codes , 2016, ArXiv.

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

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

[8]  A. Ingleton,et al.  The Rank of Circulant Matrices , 1956 .

[9]  Jingke Xu,et al.  On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding servers , 2018, Science China Information Sciences.

[10]  Puhua Guan,et al.  Exact results for deterministic cellular automata with additive rules , 1986 .

[11]  Hsuan-Yin Lin,et al.  Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes , 2017, IEEE Transactions on Information Theory.

[12]  Salim El Rouayheb,et al.  Private Information Retrieval From MDS Coded Data in Distributed Storage Systems , 2016, IEEE Transactions on Information Theory.

[13]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval From Heterogeneous Uncoded Caching Databases , 2019, IEEE Transactions on Information Theory.

[14]  Hua Sun,et al.  The Capacity of Private Information Retrieval , 2017, IEEE Transactions on Information Theory.

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

[16]  Tuvi Etzion,et al.  PIR Array Codes With Optimal Virtual Server Rate , 2016, IEEE Transactions on Information Theory.

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

[18]  Itzhak Tamo,et al.  Private Information Retrieval is Graph Based Replication Systems , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[19]  H. Niederreiter,et al.  Introduction to finite fields and their applications: Factorization of Polynomials , 1994 .

[20]  Deepak Kumar,et al.  The Capacity of Private Information Retrieval From Uncoded Storage Constrained Databases , 2018, IEEE Transactions on Information Theory.

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

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

[23]  Chao Tian,et al.  Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[24]  Camilla Hollanti,et al.  Private Information Retrieval from Coded Databases with Colluding Servers , 2016, SIAM J. Appl. Algebra Geom..

[25]  Rong-Rong Chen,et al.  An Optimal Iterative Placement Algorithm for PIR from Heterogeneous Storage-Constrained Databases , 2019, 2019 IEEE Global Communications Conference (GLOBECOM).

[26]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval From Coded Databases , 2016, IEEE Transactions on Information Theory.

[27]  Hua Sun,et al.  Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al. , 2018, IEEE Transactions on Information Theory.

[28]  Alexandre Graell i Amat,et al.  On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage , 2018, ArXiv.