Two-Level Private Information Retrieval

In the conventional robust T -colluding private information retrieval (PIR) system, the user needs to retrieve one of the possible messages while keeping the identity of the requested message private from any T colluding servers. Motivated by the possible heterogeneous privacy requirements for different messages, we consider the (N, T1 : K1, T2 : K2) two-level PIR system, where K1 messages need to be retrieved privately against T1 colluding servers, and all the messages need to be retrieved privately against T2 colluding servers where T2 ≤ T1. We obtain a lower bound to the capacity by proposing two novel coding schemes, namely the non-uniform successive cancellation scheme and the non-uniform block cancellation scheme. A capacity upper bound is also derived. The gap between the upper bound and the lower bounds is analyzed, and shown to vanish when T1 = T2. Lastly, we show that the upper bound is in general not tight by providing a stronger bound for a special setting.

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

[2]  Hsuan-Yin Lin,et al.  Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes , 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]  Chao Tian,et al.  Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

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

[6]  Xinyu Yao,et al.  The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

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

[8]  Chao Tian,et al.  Capacity-Achieving Private Information Retrieval Codes With Optimal Message Size and Upload Cost , 2018, IEEE Transactions on Information Theory.

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

[10]  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.

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

[12]  Alexandre Graell i Amat,et al.  Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage , 2018, 2018 IEEE Information Theory Workshop (ITW).

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

[14]  Chao Tian,et al.  On the Storage Cost of Private Information Retrieval , 2019, IEEE Transactions on Information Theory.

[15]  Chao Tian,et al.  A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR Systems , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[16]  Hua Sun,et al.  Optimal Download Cost of Private Information Retrieval for Arbitrary Message Length , 2016, IEEE Transactions on Information Forensics and Security.

[17]  Ruida Zhou,et al.  New Results on the Storage-Retrieval Tradeoff in Private Information Retrieval Systems , 2020, IEEE Journal on Selected Areas in Information Theory.

[18]  Chao Tian,et al.  Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding , 2019, Inf..

[19]  Sennur Ulukus,et al.  Semantic Private Information Retrieval , 2020, IEEE Transactions on Information Theory.

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

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

[22]  James S. Plank,et al.  User Manual CAI version-1.0: An Open-Source Toolbox for Computer-Aided Investigation on the Fundamental Limits of Information Systems. , 2020 .

[23]  Rong-Rong Chen,et al.  Uncoded Placement With Linear Sub-Messages for Private Information Retrieval From Storage Constrained Databases , 2020, IEEE Transactions on Communications.