Private information retrieval schemes for codec data with arbitrary collusion patterns

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

doi:10.1109/ISIT.2017.8006861

Private information retrieval schemes for codec data with arbitrary collusion patterns

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

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

56 Scopus citations

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 (US)
Title of host publication	2017 IEEE International Symposium on Information Theory, ISIT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1908-1912
Number of pages	5
ISBN (Electronic)	9781509040964
DOIs	https://doi.org/10.1109/ISIT.2017.8006861
State	Published - Aug 9 2017
Externally published	Yes
Event	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: Jun 25 2017 → Jun 30 2017

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Other

Other	2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/Territory	Germany
City	Aachen
Period	6/25/17 → 6/30/17

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2017.8006861

Cite this

Tajeddine, R., Gnilke, O. W., Karpuk, D., Freij-Hollanti, R., Hollanti, C., & El Rouayheb, S. (2017). Private information retrieval schemes for codec data with arbitrary collusion patterns. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 1908-1912). [8006861] (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006861

@inproceedings{1b4db803355d4778b32a41ebaaade687,

title = "Private information retrieval schemes for codec 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.",

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

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",

year = "2017",

month = aug,

day = "9",

doi = "10.1109/ISIT.2017.8006861",

language = "English (US)",

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

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1908--1912",

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

address = "United States",

}

Tajeddine, R, Gnilke, OW, Karpuk, D, Freij-Hollanti, R, Hollanti, C & El Rouayheb, S 2017, Private information retrieval schemes for codec data with arbitrary collusion patterns. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006861, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 1908-1912, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 6/25/17. https://doi.org/10.1109/ISIT.2017.8006861

Private information retrieval schemes for codec data with arbitrary collusion patterns. / Tajeddine, Razane; Gnilke, Oliver W.; Karpuk, David et al.

2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1908-1912 8006861 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - Private information retrieval schemes for codec data with arbitrary collusion patterns

AU - Tajeddine, Razane

AU - Gnilke, Oliver W.

AU - Karpuk, David

AU - Freij-Hollanti, Ragnar

AU - Hollanti, Camilla

AU - El Rouayheb, Salim

PY - 2017/8/9

Y1 - 2017/8/9

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.

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

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

U2 - 10.1109/ISIT.2017.8006861

DO - 10.1109/ISIT.2017.8006861

M3 - Conference contribution

AN - SCOPUS:85034042979

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1908

EP - 1912

BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 25 June 2017 through 30 June 2017

ER -

Tajeddine R, Gnilke OW, Karpuk D, Freij-Hollanti R, Hollanti C, El Rouayheb S. Private information retrieval schemes for codec data with arbitrary collusion patterns. In 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 1908-1912. 8006861. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2017.8006861

Private information retrieval schemes for codec data with arbitrary collusion patterns

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this