Single-Server Pliable Private Information Retrieval With Side Information

We study the problem of pliable private information retrieval with side information (PPIR-SI) for the single server case. In PPIR, the messages are partitioned into nonoverlapping classes and stored in a number of noncolluding databases. The user wishes to retrieve any one message from a desired class while revealing no information about the desired class identity to the databases. In PPIR-SI, the user has prior access to some side information in the form of messages from different classes and wishes to retrieve any one new message from a desired class, i.e., the message is not included in the side information set, while revealing no information about the desired class to the databases. We characterize the capacity of (linear) single-server PPIR-SI for the case where the user's side information is unidentified, i.e., the user is oblivious of the identities of its side information messages and the database structure. We term this case PPIR-USI. Surprisingly, we show that having side information, in PPIR-USI, is disadvantageous, in terms of the download rate, compared to PPIR.

[1]  Sarah A. Obead,et al.  Multi-Message Pliable Private Information Retrieval , 2022, 2022 IEEE Information Theory Workshop (ITW).

[2]  S. Ulukus,et al.  Digital Blind Box: Random Symmetric Private Information Retrieval , 2022, 2022 IEEE Information Theory Workshop (ITW).

[3]  A. Heidarzadeh,et al.  Single-Server Private Information Retrieval With Side Information Under Arbitrary Popularity Profiles , 2022, 2022 IEEE Information Theory Workshop (ITW).

[4]  A. Sprintson,et al.  The Linear Capacity of Single-Server Individually-Private Information Retrieval With Side Information , 2022, 2022 IEEE International Symposium on Information Theory (ISIT).

[5]  S. Jafar,et al.  On Single Server Private Information Retrieval With Private Coded Side Information , 2022, IEEE Transactions on Information Theory.

[6]  Mahdi Jafari Siavoshani,et al.  Private Information Retrieval for a Multi-Message Scenario With Private Side Information , 2021, IEEE Transactions on Communications.

[7]  Giovanni Russello,et al.  Multi-CDN: Towards Privacy in Content Delivery Networks , 2020, IEEE Transactions on Dependable and Secure Computing.

[8]  Su Li,et al.  Single-server Multi-message Private Information Retrieval with Side Information: the General Cases , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[9]  Fatemeh Kazemi,et al.  The Role of Coded Side Information in Single-Server Private Information Retrieval , 2019, IEEE Transactions on Information Theory.

[10]  Jingke Xu,et al.  The Optimal Sub-Packetization of Linear Capacity-Achieving PIR Schemes With Colluding Servers , 2019, IEEE Transactions on Information Theory.

[11]  Fatemeh Kazemi,et al.  Single-Server Single-Message Online Private Information Retrieval with Side Information , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[12]  Young-Han Kim,et al.  Fundamentals of Index Coding , 2018, Found. Trends Commun. Inf. Theory.

[13]  S. Ulukus,et al.  The Capacity of Private Information Retrieval With Private Side Information Under Storage Constraints , 2018, IEEE Transactions on Information Theory.

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

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

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

[17]  Christina Fragouli,et al.  A pliable index coding approach to data shuffling , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[18]  Christina Fragouli,et al.  Private Broadcasting: An index coding approach , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[19]  Mohammad Ali Maddah-Ali,et al.  Blind Index Coding , 2015, IEEE Transactions on Information Theory.

[20]  Christina Fragouli,et al.  On Pliable Index Coding , 2019, ArXiv.

[21]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.

[22]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[23]  Yitzhak Birk,et al.  Informed-source coding-on-demand (ISCOD) over broadcast channels , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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

[25]  W. Gasarch.  A Survey on Private Information Retrieval , 2004 .