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: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

54 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 languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
Number of pages5
PublisherIEEE Signal Processing Society
Publication date9 Aug 2017
Pages1908-1912
Article number8006861
ISBN (Electronic)9781509040964
DOIs
Publication statusPublished - 9 Aug 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017

Conference

Conference2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/TerritoryGermany
CityAachen
Period25/06/201730/06/2017
SponsorEricsson AB, Huawei Technologies Co., Ltd., Qualcomm
SeriesIEEE International Symposium on Information Theory - Proceedings
ISSN2157-8095

Fingerprint

Dive into the research topics of 'Private information retrieval schemes for codec data with arbitrary collusion patterns'. Together they form a unique fingerprint.

Cite this