Bounds on the Capacity of PIR over Graphs

被引:0
|
作者
Sadeh, Bar [1 ]
Gu, Yujie [2 ]
Tamo, Itzhak [1 ]
机构
[1] Tel Aviv Univ, Dept Elect Engn Syst, IL-39040 Tel Aviv, Israel
[2] Kyushu Univ, Fac Informat Sci & Elect Engn, Fukuoka, Japan
来源
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2021年
基金
欧洲研究理事会; 以色列科学基金会;
关键词
PRIVATE INFORMATION-RETRIEVAL; DISTRIBUTED STORAGE;
D O I
10.1109/ISIT45174.2021.9518086
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:1913 / 1918
页数:6
相关论文
共 50 条
  • [21] Bounds on the Lettericity of Graphs
    Mandrick, Sean
    Vatter, Vincent
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (04):
  • [22] BOUNDS OF EIGENVALUES OF GRAPHS
    HONG, Y
    DISCRETE MATHEMATICS, 1993, 123 (1-3) : 65 - 74
  • [23] Lower-Bounds on Public-Key Operations in PIR
    Dujmovic, Jesko
    Hajiabadi, Mohammad
    ADVANCES IN CRYPTOLOGY, PT VI, EUROCRYPT 2024, 2024, 14656 : 65 - 87
  • [24] Boiling over: Breaking the bounds of conventional wisdom to get more capacity
    Knight, Patrick
    PPI, Pulp & Paper International, 1997, 39 (03):
  • [25] OPRA Capacity Bounds for Selection Diversity over Generalized Fading Channels
    Hanif, Muhammad
    Yang, Hong-Chuan
    Alouini, Mohamed-Slim
    IEEE COMMUNICATIONS LETTERS, 2014, 18 (05) : 733 - 736
  • [26] Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds
    Metelev, Dmitry
    Beznosikov, Aleksandr
    Rogozin, Alexander
    Gasnikov, Alexander
    Proskurnikov, Anton
    COMPUTATIONAL MANAGEMENT SCIENCE, 2024, 21 (01)
  • [27] Atom-bond connectivity index of graphs: a review over extremal results and bounds
    Ali, Akbar
    Das, Kinkar Ch
    Dimitrov, Darko
    Furtula, Boris
    DISCRETE MATHEMATICS LETTERS, 2021, 5 : 68 - 93
  • [28] New Bounds and a Generalization for Share Conversion for 3-Server PIR
    Paskin-Cherniavsky, Anat
    Nissenbaum, Olga
    ENTROPY, 2022, 24 (04)
  • [29] Capacity of infinite graphs over non-Archimedean ordered fields ☆
    Fischer, Florian
    Keller, Matthias
    Muranova, Anna
    Nicolussi, Noema
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2025, 543 (02)
  • [30] Improved bounds on coloring of graphs
    Ndreca, Sokol
    Procacci, Aldo
    Scoppola, Benedetto
    EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (04) : 592 - 609