Private Information Retrieval from MDS Coded Databases with Colluding Servers under Several Variant Models

Private information retrieval (PIR) gets renewed attentions due to its information-theoretic reformulation and its application in distributed storage system (DSS). The general PIR model considers a coded database containing N servers storing M files. Each file is stored independently via the same arbitrary (N,K)-MDS code. A user wants to retrieve a specific file from the database privately against an arbitrary set of T colluding servers. A key problem is to analyze the PIR capacity, defined as the maximal number of bits privately retrieved per one downloaded bit. Several extensions for the general model appear by bringing in various additional constraints. In this paper, we propose a general PIR scheme for several variant PIR models including: PIR with robust servers, PIR with Byzantine servers, the multi-file PIR model and PIR with arbitrary collusion patterns.

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

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

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

[4]  Salim El Rouayheb,et al.  Robust private information retrieval on coded data , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[6]  Mikael Skoglund,et al.  Linear symmetric private information retrieval for MDS coded distributed storage with colluding servers , 2017, 2017 IEEE Information Theory Workshop (ITW).

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

[8]  Hua Sun,et al.  Multiround Private Information Retrieval: Capacity and Storage Overhead , 2016, IEEE Transactions on Information Theory.

[9]  Gennian Ge,et al.  A general private information retrieval scheme for MDS coded databases with colluding servers , 2017, Designs, Codes and Cryptography.

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

[11]  Sergey Yekhanin,et al.  Towards 3-query locally decodable codes of subexponential length , 2008, JACM.

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

[13]  E. Kushilevitz,et al.  Barrier for Information-Theoretic Private Information Retrieval , 2002 .

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

[15]  Zeev Dvir,et al.  2-Server PIR with Sub-Polynomial Communication , 2014, STOC.

[16]  Hua Sun,et al.  The Capacity of Symmetric Private Information Retrieval , 2019, IEEE Transactions on Information Theory.

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

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

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

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

[21]  Hua Sun,et al.  The Capacity of Private Information Retrieval , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[22]  Klim Efremenko,et al.  3-Query Locally Decodable Codes of Subexponential Length , 2008 .

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

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

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

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

[27]  Abdullatif Shikfa,et al.  A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers , 2014, CANS.