Bounds on the Capacity of PIR over Graphs

Bar Sadeh, Yujie Gu, Itzhak Tamo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1913-1918
Number of pages6
ISBN (Electronic)9781538682098
DOIs
Publication statusPublished - Jul 12 2021
Event2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia
Duration: Jul 12 2021Jul 20 2021

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2021-July
ISSN (Print)2157-8095

Conference

Conference2021 IEEE International Symposium on Information Theory, ISIT 2021
Country/TerritoryAustralia
CityVirtual, Melbourne
Period7/12/217/20/21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Bounds on the Capacity of PIR over Graphs'. Together they form a unique fingerprint.

Cite this