Improved Private Information Retrieval for Coded Storage From Code Decomposition : (Invited Paper)

We consider private information retrieval (PIR) for distributed storage systems with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code. Recently, it was shown that when data is stored using certain non-MDS codes, the MDS-PIR capacity can be achieved, and is indeed the capacity of the system. In this paper, for storage codes not belonging to this class, we present a heuristic algorithm for their decomposition into punctured subcodes and a PIR protocol based on these punctured subcodes. The code decomposition is guided by the generalized Hamming weights of the storage code. We show that the proposed PIR protocol can achieve a larger PIR rate than that of all existing PIR protocols.

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

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

[3]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

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

[5]  Camilla Hollanti,et al.  $t$ -Private Information Retrieval Schemes Using Transitive Codes , 2017, IEEE Transactions on Information Theory.

[6]  Hua Sun,et al.  The Capacity of Robust Private Information Retrieval With Colluding Databases , 2016, IEEE Transactions on Information Theory.

[7]  I. G. Núñez,et al.  Generalized Hamming Weights for Linear Codes , 2001 .

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

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

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

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

[12]  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.

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

[14]  Alexandre Graell i Amat,et al.  Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage , 2018, 2018 IEEE Information Theory Workshop (ITW).