The capacity of single-server weakly-private information retrieval

被引:11
|
作者
Lin H.-Y. [1 ]
Kumar S. [1 ]
Rosnes E. [1 ]
Graell I Amat A. [1 ,2 ]
Yaakobi E. [3 ]
机构
[1] Simula UiB, Bergen
[2] The Department of Electrical Engineering, Chalmers University of Technology, Gothenburg
[3] The Department of Computer Science, Technion—Israel Institute of Technology, Haifa
基金
以色列科学基金会;
关键词
Capacity; Information leakage; Information-theoretic privacy; Private information retrieval; Single server;
D O I
10.1109/JSAIT.2021.3056327
中图分类号
学科分类号
摘要
A private information retrieval (PIR) protocol guarantees that a user can privately retrieve files stored in a database without revealing any information about the identity of the requested file. Existing information-theoretic PIR protocols ensure perfect privacy, i.e., zero information leakage to the servers storing the database, but at the cost of high download. In this work, we present weakly-private information retrieval (WPIR) schemes that trade off perfect privacy to improve the download cost when the database is stored on a single server. We study the tradeoff between the download cost and information leakage in terms of mutual information (MI) and maximal leakage (MaxL) privacy metrics. By relating the WPIR problem to rate-distortion theory, the download-leakage function, which is defined as the minimum required download cost of all single-server WPIR schemes for a given level of information leakage and a fixed file size, is introduced. By characterizing the download-leakage function for the MI and MaxL metrics, the capacity of single-server WPIR is fully described. © 2021 IEEE.
引用
收藏
页码:415 / 427
页数:12
相关论文
共 50 条
  • [1] The Capacity of Single-Server Weakly-Private Information Retrieval
    Lin, Hsuan-Yin
    Kumar, Siddhartha
    Rosnes, Eirik
    Amat, Alexandre Graell i
    Yaakobi, Eitan
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1053 - 1058
  • [2] Multi-Server Weakly-Private Information Retrieval
    Lin, Hsuan-Yin
    Kumar, Siddhartha
    Rosnes, Eirik
    Amat, Alexandre Graell i
    Yaakobi, Eitan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (02) : 1197 - 1219
  • [3] Weakly-Private Information Retrieval
    Lin, Hsuan-Yin
    Kumar, Siddhartha
    Rosnes, Eirik
    Graell i Amat, Alexandre
    Yaakobi, Eitan
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1257 - 1261
  • [4] Optimal Single-Server Private Information Retrieval
    Zhou, Mingxun
    Lin, Wei-Kai
    Tselekounis, Yiannis
    Shi, Elaine
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2023, PT I, 2023, 14004 : 395 - 425
  • [5] Hintless Single-Server Private Information Retrieval
    Li, Baiyu
    Micciancio, Daniele
    Raykova, Mariana
    Schultz-Wu, Mark
    ADVANCES IN CRYPTOLOGY - CRYPTO 2024, PT IX, 2024, 14928 : 183 - 217
  • [6] Capacity of Single-Server Single-Message Private Information Retrieval with Private Coded Side Information
    Heidarzadeh, Anoosheh
    Kazemi, Fatemeh
    Sprintson, Alex
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1662 - 1666
  • [7] Capacity of Single-Server Single-Message Private Information Retrieval with Coded Side Information
    Heidarzadeh, Anoosheh
    Kazemi, Fatemeh
    Sprintson, Alex
    2018 IEEE INFORMATION THEORY WORKSHOP (ITW), 2018, : 340 - 344
  • [8] On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information
    Heidarzadeh, Anoosheh
    Garcia, Brenden
    Kadhe, Swanand
    El Rouayheb, Salim
    Sprintson, Alex
    2018 56TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2018, : 180 - 187
  • [9] The Role of Coded Side Information in Single-Server Private Information Retrieval
    Heidarzadeh, Anoosheh
    Kazemi, Fatemeh
    Sprintson, Alex
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (01) : 25 - 44
  • [10] Single-Server Private Information Retrieval with Sublinear Amortized Time
    Corrigan-Gibbs, Henry
    Henzinger, Alexandra
    Kogan, Dmitry
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2022, PT II, 2022, 13276 : 3 - 33