Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns

Razane Tajeddine; Oliver Gnilke; David Karpuk; Ragnar Freij-Hollanti; Camilla Hollanti; Salim El Rouayheb

doi:10.1109/ISIT.2017.8006861

Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns

Razane Tajeddine, Oliver Gnilke, David Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti, Salim El Rouayheb

Illinois Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

68 Citations (Scopus)

Abstract

In Private Information Retrieval (PIR), one wants to download a file from a database without revealing to the database which file is being downloaded. Much attention has been paid to the case of the database being encoded across several servers, subsets of which can collude to attempt to deduce the requested file. With the goal of studying the achievable PIR rates in realistic scenarios, we generalize results for coded data from the case of all subsets of servers of size t colluding, to arbitrary subsets of the servers. We investigate the effectiveness of previous strategies in this new scenario, and present new results in the case where the servers are partitioned into disjoint colluding groups.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory (ISIT)
Publisher	IEEE
Pages	1908-1912
Number of pages	5
ISBN (Electronic)	978-1-5090-4096-4
DOIs	https://doi.org/10.1109/ISIT.2017.8006861
Publication status	Published - 2017
MoE publication type	A4 Conference publication
Event	IEEE International Symposium on Information Theory - Eurogress Aachen, Aachen, Germany Duration: 25 Jun 2017 → 30 Jun 2017 https://isit2017.org/

Publication series

Name	IEEE International Symposium on Information Theory
Publisher	IEEE
ISSN (Electronic)	2157-8117

Conference

Conference	IEEE International Symposium on Information Theory
Abbreviated title	ISIT
Country/Territory	Germany
City	Aachen
Period	25/06/2017 → 30/06/2017
Internet address	https://isit2017.org/

Keywords

Servers
Linear codes
Data privacy
Information retrieval

Access to Document

10.1109/ISIT.2017.8006861

https://arxiv.org/abs/1701.07636

Cite this

Tajeddine, R., Gnilke, O., Karpuk, D., Freij-Hollanti, R., Hollanti, C., & El Rouayheb, S. (2017). Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns. In 2017 IEEE International Symposium on Information Theory (ISIT) (pp. 1908-1912). Article 8006861 (IEEE International Symposium on Information Theory). IEEE. https://doi.org/10.1109/ISIT.2017.8006861

@inproceedings{812ab6999ba64c6ea933a38fcb33386c,

title = "Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns",

abstract = "In Private Information Retrieval (PIR), one wants to download a file from a database without revealing to the database which file is being downloaded. Much attention has been paid to the case of the database being encoded across several servers, subsets of which can collude to attempt to deduce the requested file. With the goal of studying the achievable PIR rates in realistic scenarios, we generalize results for coded data from the case of all subsets of servers of size t colluding, to arbitrary subsets of the servers. We investigate the effectiveness of previous strategies in this new scenario, and present new results in the case where the servers are partitioned into disjoint colluding groups.",

keywords = "Servers, Linear codes, Data privacy, Information retrieval",

author = "Razane Tajeddine and Oliver Gnilke and David Karpuk and Ragnar Freij-Hollanti and Camilla Hollanti and {El Rouayheb}, Salim",

year = "2017",

doi = "10.1109/ISIT.2017.8006861",

language = "English",

series = "IEEE International Symposium on Information Theory",

publisher = "IEEE",

pages = "1908--1912",

booktitle = "2017 IEEE International Symposium on Information Theory (ISIT)",

address = "United States",

note = "IEEE International Symposium on Information Theory, ISIT ; Conference date: 25-06-2017 Through 30-06-2017",

url = "https://isit2017.org/",

}

Tajeddine, R, Gnilke, O, Karpuk, D, Freij-Hollanti, R , Hollanti, C & El Rouayheb, S 2017, Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns. in 2017 IEEE International Symposium on Information Theory (ISIT) ., 8006861, IEEE International Symposium on Information Theory, IEEE, pp. 1908-1912, IEEE International Symposium on Information Theory, Aachen, Germany, 25/06/2017. https://doi.org/10.1109/ISIT.2017.8006861

Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns. / Tajeddine, Razane; Gnilke, Oliver; Karpuk, David et al.
2017 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2017. p. 1908-1912 8006861 (IEEE International Symposium on Information Theory).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns

AU - Tajeddine, Razane

AU - Gnilke, Oliver

AU - Karpuk, David

AU - Freij-Hollanti, Ragnar

AU - Hollanti, Camilla

AU - El Rouayheb, Salim

PY - 2017

Y1 - 2017

N2 - In Private Information Retrieval (PIR), one wants to download a file from a database without revealing to the database which file is being downloaded. Much attention has been paid to the case of the database being encoded across several servers, subsets of which can collude to attempt to deduce the requested file. With the goal of studying the achievable PIR rates in realistic scenarios, we generalize results for coded data from the case of all subsets of servers of size t colluding, to arbitrary subsets of the servers. We investigate the effectiveness of previous strategies in this new scenario, and present new results in the case where the servers are partitioned into disjoint colluding groups.

AB - In Private Information Retrieval (PIR), one wants to download a file from a database without revealing to the database which file is being downloaded. Much attention has been paid to the case of the database being encoded across several servers, subsets of which can collude to attempt to deduce the requested file. With the goal of studying the achievable PIR rates in realistic scenarios, we generalize results for coded data from the case of all subsets of servers of size t colluding, to arbitrary subsets of the servers. We investigate the effectiveness of previous strategies in this new scenario, and present new results in the case where the servers are partitioned into disjoint colluding groups.

KW - Servers

KW - Linear codes

KW - Data privacy

KW - Information retrieval

U2 - 10.1109/ISIT.2017.8006861

DO - 10.1109/ISIT.2017.8006861

M3 - Conference article in proceedings

T3 - IEEE International Symposium on Information Theory

SP - 1908

EP - 1912

BT - 2017 IEEE International Symposium on Information Theory (ISIT)

PB - IEEE

T2 - IEEE International Symposium on Information Theory

Y2 - 25 June 2017 through 30 June 2017

ER -

Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this