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 | |
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 |
Keywords
- Servers
- Linear codes
- Data privacy
- Information retrieval