Bounds on the Capacity of PIR over Graphs

In the private information retrieval (PIR) problem, a user wants to retrieve a file from a database without revealing any information about the desired file's identity to the servers that store the database. In this paper, we study the PIR capacity of a graph-based replication system, in which each file is stored on two distinct servers according to an underlying graph. This paper aims to provide upper and lower bounds to the PIR capacity of graphs via various graph properties. In particular, we provide several upper bounds on the PIR capacity that apply to all graphs. We further improve the bounds for specific graph families (which turn out to be tight in certain cases) by utilizing the underlying graph structure. For the lower bounds, we establish optimal rate PIR retrieval schemes for star graphs via edge-coloring techniques. Lastly, we provide an improved PIR scheme for complete graphs, which implies an improved general lower bound on all graphs' PIR capacity.

[1]  Mikael Skoglund,et al.  Symmetric Private Information Retrieval from MDS Coded Distributed Storage With Non-Colluding and Colluding Servers , 2019, IEEE Transactions on Information Theory.

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

[3]  Itzhak Tamo,et al.  Private Information Retrieval is Graph Based Replication Systems , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[4]  Sennur Ulukus,et al.  Private Information Retrieval from Non-Replicated Databases , 2018, 2019 IEEE International Symposium on Information Theory (ISIT).

[5]  Andrea Asperti,et al.  A proof of Bertrand's postulate , 2012, J. Formaliz. Reason..

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

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

[8]  Dragan Marusic,et al.  Hamilton cycles and paths in vertex-transitive graphs - Current directions , 2009, Discret. Math..

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

[10]  Syed Ali Jafar,et al.  On the Asymptotic Capacity of X-Secure T-Private Information Retrieval With Graph-Based Replicated Storage , 2019, IEEE Transactions on Information Theory.

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

[12]  Hua Sun,et al.  The capacity of private information retrieval with colluding databases , 2016, 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[13]  Kannan Ramchandran,et al.  Fractional repetition codes for repair in distributed storage systems , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  Hua Sun,et al.  The Capacity of Symmetric Private Information Retrieval , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

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

[16]  Andris Ambainis,et al.  On Lower Bounds for the Communication Complexity of Private Information Retrieval ∗ , 2000 .

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

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

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