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

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

61 Citationer (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.

Originalsprog	Engelsk
Titel	2017 IEEE International Symposium on Information Theory, ISIT 2017
Antal sider	5
Forlag	IEEE Signal Processing Society
Publikationsdato	9 aug. 2017
Sider	1908-1912
Artikelnummer	8006861
ISBN (Elektronisk)	9781509040964
DOI	https://doi.org/10.1109/ISIT.2017.8006861
Status	Udgivet - 9 aug. 2017
Begivenhed	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Tyskland Varighed: 25 jun. 2017 → 30 jun. 2017

Konference

Konference	2017 IEEE International Symposium on Information Theory, ISIT 2017
Land/Område	Tyskland
By	Aachen
Periode	25/06/2017 → 30/06/2017
Sponsor	Ericsson AB, Huawei Technologies Co., Ltd., Qualcomm

Navn	IEEE International Symposium on Information Theory - Proceedings
ISSN	2157-8095

Adgang til dokumentet

10.1109/ISIT.2017.8006861

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Andre filer og links

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

Citationsformater

@inproceedings{3bba28d0547147279b413a3f1c933aa6,

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",

year = "2017",

month = aug,

day = "9",

doi = "10.1109/ISIT.2017.8006861",

language = "English",

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

publisher = "IEEE Signal Processing Society",

pages = "1908--1912",

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

address = "United States",

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

}

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. i 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006861, IEEE Signal Processing Society, IEEE International Symposium on Information Theory - Proceedings, s. 1908-1912, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Tyskland, 25/06/2017. 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. IEEE Signal Processing Society, 2017. s. 1908-1912 8006861 (IEEE International Symposium on Information Theory - Proceedings).

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

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

U2 - 10.1109/ISIT.2017.8006861

DO - 10.1109/ISIT.2017.8006861

M3 - Article in proceeding

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 - IEEE Signal Processing Society

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. I 2017 IEEE International Symposium on Information Theory, ISIT 2017. IEEE Signal Processing Society. 2017. s. 1908-1912. 8006861. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2017.8006861