Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage

We consider private information retrieval (PIR) for distributed storage systems (DSSs) with noncolluding nodes where data is stored using a non maximum distance separable (MDS) linear code. It was recently shown that if data is stored using a particular class of non-MDS linear codes, the MDS-PIR capacity, i.e., the maximum possible PIR rate for MDS-coded DSSs, can be achieved. For this class of codes, we prove that the PIR capacity is indeed equal to the MDS-PIR capacity, giving the first family of non-MDS codes for which the PIR capacity is known. For other codes, we provide asymmetric PIR protocols that achieve a strictly larger PIR rate compared to existing symmetric PIR protocols.

[1]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

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

[3]  Alexandre Graell i Amat,et al.  An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[4]  J. Radhakrishnan Entropy and Counting ∗ , 2001 .

[5]  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).

[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]  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.  Achieving Private Information Retrieval Capacity in Distributed Storage Using an Arbitrary Linear Code , 2017, ArXiv.

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

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

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

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

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

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