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

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

37 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)
PublisherIEEE
Pages1908-1912
Number of pages5
ISBN (Electronic)978-1-5090-4096-4
DOIs
Publication statusPublished - 2017
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Eurogress Aachen, Aachen, Germany
Duration: 25 Jun 201730 Jun 2017
https://isit2017.org/

Publication series

NameIEEE International Symposium on Information Theory
PublisherIEEE
ISSN (Electronic)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
CountryGermany
CityAachen
Period25/06/201730/06/2017
Internet address

Keywords

  • Servers
  • Linear codes
  • Data privacy
  • Information retrieval

Fingerprint Dive into the research topics of 'Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns'. Together they form a unique fingerprint.

Cite this