Multi-Message Private Information Retrieval with Private Side Information

We consider the problem of private information retrieval (PIR) where a single user with private side information aims to retrieve multiple files from a library stored (uncoded) at a number of servers. We assume the side information at the user includes a subset of files stored privately (i.e., the server does not know the indices of these files). In addition, we require that the identity of requests and side information at the user are not revealed to any of the servers. The problem involves finding the minimum load to be transmitted from the servers to the user such that the requested files can be decoded with the help of received and side information. By providing matching lower and upper bounds, for certain regimes, we characterize the minimum load imposed to all the servers (i.e., the capacity of this PIR problem). Our result shows that the capacity is the same as the capacity of a multi-message PIR problem without private side information, but with a library of reduced size. The effective size of the library is equal to the original library size minus the size of side information.

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

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

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

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

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

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

[7]  Mikael Skoglund,et al.  Secure symmetric private information retrieval from colluding databases with adversaries , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

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

[10]  Hua Sun,et al.  The Capacity of Private Computation , 2018, 2018 IEEE International Conference on Communications (ICC).

[11]  Ravi Tandon,et al.  The capacity of cache aided private information retrieval , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

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

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

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

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