Improved Storage for Efficient Private Information Retrieval

We consider the problem of private information retrieval from N storage- constrained databases. In this problem, a user wishes to retrieve a single message out of M messages (of size L) without revealing any information about the identity of the message to individual databases. Each database stores $\mu M L$ symbols, i.e., a $\mu$ fraction of the entire library, where $\frac{1}{N} \leq \mu \leq 1.$ Our goal is to characterize the optimal tradeoff curve for the storage cost (captured by $\mu$) and the normalized download cost $(D / L).$ We show that the download cost can be reduced by employing a hybrid storage scheme that combines MDS coding ideas with uncoded partial replication ideas. When there is no coding, our scheme reduces to Attia-Kumar-Tandon storage scheme, which was initially introduced by Maddah-AliNiesen in the context of the caching problem, and when there is no uncoded partial replication, our scheme reduces to Banawan-Ulukus storage scheme; in general, our scheme outperforms both.

[1]  Sennur Ulukus,et al.  Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval , 2018, IEEE Transactions on Information Theory.

[2]  Silvio Micali,et al.  Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.

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

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

[5]  Eitan Yaakobi,et al.  PIR with Low Storage Overhead: Coding instead of Replication , 2015, ArXiv.

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

[7]  Siddhartha Kumar,et al.  Private Information Retrieval From a Cellular Network With Caching at the Edge , 2018, IEEE Transactions on Communications.

[8]  Sennur Ulukus,et al.  Private Information Retrieval from Non-Replicated Databases , 2018, 2019 IEEE International Symposium on Information Theory (ISIT).

[9]  Hua Sun,et al.  Blind interference alignment for private information retrieval , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[11]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval from Byzantine and Colluding Databases , 2017, IEEE Transactions on Information Theory.

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

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

[14]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[15]  Hua Sun,et al.  The Capacity of Symmetric Private Information Retrieval , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[16]  Chao Tian,et al.  Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost , 2018, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

[17]  Sennur Ulukus,et al.  Asymmetry Hurts: Private Information Retrieval Under Asymmetric Traffic Constraints , 2018, IEEE Transactions on Information Theory.

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

[19]  Mahtab Mirmohseni,et al.  Private function retrieval , 2017, 2018 Iran Workshop on Communication and Information Theory (IWCIT).

[20]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval With Partially Known Private Side Information , 2019, IEEE Transactions on Information Theory.

[21]  Sennur Ulukus,et al.  Cache-Aided Private Information Retrieval With Partially Known Uncoded Prefetching: Fundamental Limits , 2017, IEEE Journal on Selected Areas in Communications.

[22]  Sennur Ulukus,et al.  Private Information Retrieval with Private Side Information Under Storage Constraints , 2018, 2018 IEEE Information Theory Workshop (ITW).

[23]  Sennur Ulukus,et al.  Fundamental Limits of Cache-Aided Private Information Retrieval With Unknown and Uncoded Prefetching , 2017, IEEE Transactions on Information Theory.

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

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

[26]  Sennur Ulukus,et al.  The Capacity of Private Information Retrieval from Decentralized Uncoded Caching Databases , 2019, Inf..

[27]  Hua Sun,et al.  Cross Subspace Alignment and the Asymptotic Capacity of $X$ -Secure $T$ -Private Information Retrieval , 2018, IEEE Transactions on Information Theory.

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

[29]  Sennur Ulukus,et al.  Multi-Message Private Information Retrieval: Capacity Results and Near-Optimal Schemes , 2017, IEEE Transactions on Information Theory.

[30]  William Gasarch.  A Survey on Private Information Retrieval , 2004 .

[31]  Syed Ali Jafar,et al.  The Capacity of Private Information Retrieval with Private Side Information , 2017, ArXiv.

[32]  Salim El Rouayheb,et al.  Staircase-PIR: Universally Robust Private Information Retrieval , 2018, 2018 IEEE Information Theory Workshop (ITW).

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

[34]  Syed Ali Jafar,et al.  The Asymptotic Capacity of Private Search , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[35]  Michael Gastpar,et al.  Single-server Multi-message Private Information Retrieval with Side Information , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[36]  Swanand Kadhe,et al.  Private Information Retrieval With Side Information , 2017, IEEE Transactions on Information Theory.

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

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

[39]  Sennur Ulukus,et al.  Private Information Retrieval Through Wiretap Channel II: Privacy Meets Security , 2018, IEEE Transactions on Information Theory.