Single-server Multi-message Private Information Retrieval with Side Information

We study the problem of single-server multi-message private information retrieval with side information. One user wants to recover N out of K independent messages which are stored at a single server. The user initially possesses a subset of M messages as side information. The goal of the user is to download the N demand messages while not leaking any information about the indices of these messages to the server. In this paper, we characterize the minimum number of required transmissions for linear codes. Moreover, we present an optimal coding scheme which enables the user to download the demand messages and preserves the privacy of their indices by using linear codes. Additionally, we show that the trivial MDS coding scheme with K-M transmissions is optimal if $N \gt M$ or $N^{2}+N \geq K-M$. This means if one wishes to privately download more than the square-root of the number of files in the database, then one must effectively download the full database (minus the side information), irrespective of the amount of side information one has available.

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

[2]  Yuval Ishai,et al.  Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

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

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

[6]  Mahdi Jafari Siavoshani,et al.  Multi-Message Private Information Retrieval with Private Side Information , 2018, 2018 IEEE Information Theory Workshop (ITW).

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

[8]  Salim El Rouayheb,et al.  Private Information Retrieval From MDS Coded Data in Distributed Storage Systems , 2016, 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]  Silvio Micali,et al.  Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.

[11]  Sennur Ulukus,et al.  Private information retrieval from coded databases , 2017, 2017 IEEE International Conference on Communications (ICC).

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

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

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

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

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

[17]  Michael Gastpar,et al.  Single-server Multi-user Private Information Retrieval with Side Information , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[18]  Sennur Ulukus,et al.  Multi-message private information retrieval , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[20]  Swanand Kadhe,et al.  On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[22]  Camilla Hollanti,et al.  Private information retrieval schemes for codec data with arbitrary collusion patterns , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).