The Capacity of Single-Server Weakly-Private Information Retrieval

Hsuan Yin Lin; Siddhartha Kumar; Eirik Rosnes; Alexandre Graell I. Amat; Eitan Yaakobi

doi:10.1109/ISIT44484.2020.9174048

The Capacity of Single-Server Weakly-Private Information Retrieval

Hsuan Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell I. Amat, Eitan Yaakobi

Computer Science

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Weakly-private information retrieval (WPIR) is a variant of the private information retrieval problem in which a user wants to efficiently retrieve a file stored across a set of servers while tolerating some information leakage on the identity of the requested file to the servers. In this paper, we consider WPIR from a single-server database where the information leakage is measured in terms of the mutual information (MI) or maximal leakage (MaxL) privacy metrics. In particular, we establish a connection between the WPIR problem and rate-distortion theory, and fully characterize the optimal tradeoff between the download cost and the allowed information leakage under the MI and MaxL metrics, settling the single-server WPIR capacity.

Original language	English
Title of host publication	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
Pages	1053-1058
Number of pages	6
ISBN (Electronic)	9781728164328
DOIs	https://doi.org/10.1109/ISIT44484.2020.9174048
State	Published - Jun 2020
Event	2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States Duration: 21 Jul 2020 → 26 Jul 2020

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2020-June

Conference

Conference	2020 IEEE International Symposium on Information Theory, ISIT 2020
Country/Territory	United States
City	Los Angeles
Period	21/07/20 → 26/07/20

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT44484.2020.9174048

Cite this

Lin, H. Y., Kumar, S., Rosnes, E., Amat, A. G. I., & Yaakobi, E. (2020). The Capacity of Single-Server Weakly-Private Information Retrieval. In 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings (pp. 1053-1058). Article 9174048 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June). https://doi.org/10.1109/ISIT44484.2020.9174048

@inproceedings{c44eef731d324e1cb27f3c784cd437cf,

title = "The Capacity of Single-Server Weakly-Private Information Retrieval",

abstract = "Weakly-private information retrieval (WPIR) is a variant of the private information retrieval problem in which a user wants to efficiently retrieve a file stored across a set of servers while tolerating some information leakage on the identity of the requested file to the servers. In this paper, we consider WPIR from a single-server database where the information leakage is measured in terms of the mutual information (MI) or maximal leakage (MaxL) privacy metrics. In particular, we establish a connection between the WPIR problem and rate-distortion theory, and fully characterize the optimal tradeoff between the download cost and the allowed information leakage under the MI and MaxL metrics, settling the single-server WPIR capacity.",

author = "Lin, \{Hsuan Yin\} and Siddhartha Kumar and Eirik Rosnes and Amat, \{Alexandre Graell I.\} and Eitan Yaakobi",

note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 2020 IEEE International Symposium on Information Theory, ISIT 2020 ; Conference date: 21-07-2020 Through 26-07-2020",

year = "2020",

month = jun,

doi = "10.1109/ISIT44484.2020.9174048",

language = "الإنجليزيّة",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1053--1058",

booktitle = "2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings",

}

Lin, HY, Kumar, S, Rosnes, E, Amat, AGI & Yaakobi, E 2020, The Capacity of Single-Server Weakly-Private Information Retrieval. in 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings., 9174048, IEEE International Symposium on Information Theory - Proceedings, vol. 2020-June, pp. 1053-1058, 2020 IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, United States, 21/07/20. https://doi.org/10.1109/ISIT44484.2020.9174048

The Capacity of Single-Server Weakly-Private Information Retrieval. / Lin, Hsuan Yin; Kumar, Siddhartha; Rosnes, Eirik et al.
2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings. 2020. p. 1053-1058 9174048 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2020-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The Capacity of Single-Server Weakly-Private Information Retrieval

AU - Lin, Hsuan Yin

AU - Kumar, Siddhartha

AU - Rosnes, Eirik

AU - Amat, Alexandre Graell I.

AU - Yaakobi, Eitan

PY - 2020/6

Y1 - 2020/6

N2 - Weakly-private information retrieval (WPIR) is a variant of the private information retrieval problem in which a user wants to efficiently retrieve a file stored across a set of servers while tolerating some information leakage on the identity of the requested file to the servers. In this paper, we consider WPIR from a single-server database where the information leakage is measured in terms of the mutual information (MI) or maximal leakage (MaxL) privacy metrics. In particular, we establish a connection between the WPIR problem and rate-distortion theory, and fully characterize the optimal tradeoff between the download cost and the allowed information leakage under the MI and MaxL metrics, settling the single-server WPIR capacity.

AB - Weakly-private information retrieval (WPIR) is a variant of the private information retrieval problem in which a user wants to efficiently retrieve a file stored across a set of servers while tolerating some information leakage on the identity of the requested file to the servers. In this paper, we consider WPIR from a single-server database where the information leakage is measured in terms of the mutual information (MI) or maximal leakage (MaxL) privacy metrics. In particular, we establish a connection between the WPIR problem and rate-distortion theory, and fully characterize the optimal tradeoff between the download cost and the allowed information leakage under the MI and MaxL metrics, settling the single-server WPIR capacity.

UR - http://www.scopus.com/inward/record.url?scp=85090425172&partnerID=8YFLogxK

U2 - 10.1109/ISIT44484.2020.9174048

DO - 10.1109/ISIT44484.2020.9174048

M3 - منشور من مؤتمر

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1053

EP - 1058

BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings

T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020

Y2 - 21 July 2020 through 26 July 2020

ER -

The Capacity of Single-Server Weakly-Private Information Retrieval

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this