Bounds on the Capacity of PIR over Graphs

Bar Sadeh, Yujie Gu, Itzhak Tamo

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

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.

本文言語英語
ホスト出版物のタイトル2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
出版社Institute of Electrical and Electronics Engineers Inc.
ページ1913-1918
ページ数6
ISBN(電子版)9781538682098
DOI
出版ステータス出版済み - 7 12 2021
イベント2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, オーストラリア
継続期間: 7 12 20217 20 2021

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
2021-July
ISSN(印刷版)2157-8095

会議

会議2021 IEEE International Symposium on Information Theory, ISIT 2021
国/地域オーストラリア
CityVirtual, Melbourne
Period7/12/217/20/21

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 情報システム
  • モデリングとシミュレーション
  • 応用数学

フィンガープリント

「Bounds on the Capacity of PIR over Graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル