A Capacity-Achieving PIR Protocol for Distributed Storage Using an Arbitrary Linear Code

We propose a private information retrieval (PIR) protocol for distributed storage systems (DSSs) with noncolluding nodes where data is stored using an arbitrary linear code. An expression for the PIR rate, i.e., the ratio of the amount of retrieved stored data per unit of downloaded data, is derived, and a necessary and a sufficient condition for codes to achieve the PIR capacity are given. The necessary condition is based on the generalized Hamming weights of the storage code, while the sufficient condition is based on code automorphisms. We show that cyclic codes and Reed-Muller codes satisfy the sufficient condition and are thus PIR capacity-achieving.

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

[2]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  A. Ashikhmin.  Generalized Hamming Weights for &-Linear Codes , 2015 .

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

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

[6]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

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

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

[9]  Alexandre Graell i Amat,et al.  Private information retrieval in distributed storage systems using an arbitrary linear code , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[11]  Alexandre Graell i Amat,et al.  Achieving Private Information Retrieval Capacity in Distributed Storage Using an Arbitrary Linear Code , 2017, ArXiv.

[12]  Rafail Ostrovsky,et al.  Batch codes and their applications , 2004, STOC '04.

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

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

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