Paper Info
Title
Single-Server Multi-Message Individually-Private Information Retrieval With Side Information
Abstract
We consider a multi-user variant of the private information retrieval problem described as follows. Suppose there are D users, each of which wants to privately retrieve a distinct message from a server with the help of a trusted agent. We assume that the agent has a subset of M messages whose indices are unknown to the server. The goal of the agent is to collectively retrieve the users' requests from the server. For this problem, we introduce the notion of individual-privacy - the agent is required to protect the privacy only for each individual user (but may leak some correlations among user requests). We refer to this problem as Individually-Private Information Retrieval with Side Information (IPIR-SI).We first establish a lower bound on the capacity, which is defined as the maximum achievable download rate, of the IPIR-SI problem by presenting a novel achievability protocol. Next, we characterize the capacity of IPIR-SI problem for M = 1 and D = 2. In the process of characterizing the capacity for arbitrary M and D we present a novel combinatorial conjecture, that may be of independent interest.
Year
DOI
Venue
2019
10.1109/ISIT.2019.8849283
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
Field
DocType
Volume
Mathematical optimization,Upper and lower bounds,Download,Side information,Theoretical computer science,Conjecture,Private information retrieval,Mathematics
Journal
abs/1901.07509
Citations 
PageRank 
References 
0
0.34
11
Authors
4
Name
Order
Citations
PageRank
Anoosheh Heidarzadeh14114.58
Swanand Kadhe25411.22
Salim Y. El Rouayheb318818.00
Alex Sprintson427935.35