On the Capacity of Leaky Private Information Retrieval

Islam Samy, Ravi Tandon, Loukas Lazos

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

Abstract

Private information retrieval (PIR) allows users to retrieve data from databases without revealing the identity of that data. An extensive body of works has investigated efficient schemes to achieve computational and information-theoretic privacy. The latter guarantees that no information is revealed to the databases, irrespective of their computational power. Although information-theoretic PIR (IT-PIR) provides a strong privacy guarantee, it can be too taxing for certain applications. In this paper, we initiate the study of leaky private information retrieval (L-PIR), where a bounded amount of privacy leakage is allowed and measured through a parameter ϵ. The classical IT-PIR formulation is obtained by setting ϵ = 0, and for ϵ > 0, we explore the opportunities offered for reducing the download cost. We derive new upper and lower bounds on the download cost of L-PIR for any arbitrary ϵ, any number of messages K, and for N = 2 databases.

Original languageEnglish (US)
Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1262-1266
Number of pages5
ISBN (Electronic)9781538692912
DOIs
StatePublished - Jul 2019
Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
Duration: Jul 7 2019Jul 12 2019

Publication series

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

Conference

Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
CountryFrance
CityParis
Period7/7/197/12/19

Fingerprint

Private Information Retrieval
Information retrieval
Privacy
Costs
Leakage
Upper and Lower Bounds
Formulation
Arbitrary

ASJC Scopus subject areas

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

Cite this

Samy, I., Tandon, R., & Lazos, L. (2019). On the Capacity of Leaky Private Information Retrieval. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 1262-1266). [8849676] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849676

On the Capacity of Leaky Private Information Retrieval. / Samy, Islam; Tandon, Ravi; Lazos, Loukas.

2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 1262-1266 8849676 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

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

Samy, I, Tandon, R & Lazos, L 2019, On the Capacity of Leaky Private Information Retrieval. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849676, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 1262-1266, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/7/19. https://doi.org/10.1109/ISIT.2019.8849676
Samy I, Tandon R, Lazos L. On the Capacity of Leaky Private Information Retrieval. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 1262-1266. 8849676. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2019.8849676
Samy, Islam ; Tandon, Ravi ; Lazos, Loukas. / On the Capacity of Leaky Private Information Retrieval. 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 1262-1266 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{42b86970b1fe493b927fab7363c94b13,
title = "On the Capacity of Leaky Private Information Retrieval",
abstract = "Private information retrieval (PIR) allows users to retrieve data from databases without revealing the identity of that data. An extensive body of works has investigated efficient schemes to achieve computational and information-theoretic privacy. The latter guarantees that no information is revealed to the databases, irrespective of their computational power. Although information-theoretic PIR (IT-PIR) provides a strong privacy guarantee, it can be too taxing for certain applications. In this paper, we initiate the study of leaky private information retrieval (L-PIR), where a bounded amount of privacy leakage is allowed and measured through a parameter ϵ. The classical IT-PIR formulation is obtained by setting ϵ = 0, and for ϵ > 0, we explore the opportunities offered for reducing the download cost. We derive new upper and lower bounds on the download cost of L-PIR for any arbitrary ϵ, any number of messages K, and for N = 2 databases.",
author = "Islam Samy and Ravi Tandon and Loukas Lazos",
year = "2019",
month = "7",
doi = "10.1109/ISIT.2019.8849676",
language = "English (US)",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1262--1266",
booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

}

TY - GEN

T1 - On the Capacity of Leaky Private Information Retrieval

AU - Samy, Islam

AU - Tandon, Ravi

AU - Lazos, Loukas

PY - 2019/7

Y1 - 2019/7

N2 - Private information retrieval (PIR) allows users to retrieve data from databases without revealing the identity of that data. An extensive body of works has investigated efficient schemes to achieve computational and information-theoretic privacy. The latter guarantees that no information is revealed to the databases, irrespective of their computational power. Although information-theoretic PIR (IT-PIR) provides a strong privacy guarantee, it can be too taxing for certain applications. In this paper, we initiate the study of leaky private information retrieval (L-PIR), where a bounded amount of privacy leakage is allowed and measured through a parameter ϵ. The classical IT-PIR formulation is obtained by setting ϵ = 0, and for ϵ > 0, we explore the opportunities offered for reducing the download cost. We derive new upper and lower bounds on the download cost of L-PIR for any arbitrary ϵ, any number of messages K, and for N = 2 databases.

AB - Private information retrieval (PIR) allows users to retrieve data from databases without revealing the identity of that data. An extensive body of works has investigated efficient schemes to achieve computational and information-theoretic privacy. The latter guarantees that no information is revealed to the databases, irrespective of their computational power. Although information-theoretic PIR (IT-PIR) provides a strong privacy guarantee, it can be too taxing for certain applications. In this paper, we initiate the study of leaky private information retrieval (L-PIR), where a bounded amount of privacy leakage is allowed and measured through a parameter ϵ. The classical IT-PIR formulation is obtained by setting ϵ = 0, and for ϵ > 0, we explore the opportunities offered for reducing the download cost. We derive new upper and lower bounds on the download cost of L-PIR for any arbitrary ϵ, any number of messages K, and for N = 2 databases.

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

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

U2 - 10.1109/ISIT.2019.8849676

DO - 10.1109/ISIT.2019.8849676

M3 - Conference contribution

AN - SCOPUS:85073143805

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1262

EP - 1266

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

PB - Institute of Electrical and Electronics Engineers Inc.

ER -