Multi-Message Private Information Retrieval with Private Side Information
Multi-Message Private Information Retrieval with Private Side Information
复制标题
带有私密侧信息的多消息私密信息检索
DOI：
10.1109/itw.2018.8613486
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
M. Maddah
中科院分区：
文献类型：
--
作者：
S. P. Shariatpanahi;M. J. Siavoshani;M. Maddah
我们考虑私有信息检索（PIR）问题，其中具有私有侧信息的单个用户旨在从存储在多个服务器上（未编码）的库中检索多个文件。我们假设用户处的侧信息包括私有存储的文件子集（即，服务器不知道这些文件的索引）。此外，我们要求不向任何服务器透露请求的身份和用户的侧信息。这个问题涉及到找到要从服务器传输到用户的最小负载，这样所请求的文件就可以借助接收到的和附带的信息进行解码。通过为某些制度提供匹配的下限和上限，我们描述了强加给所有服务器的最小负载（即，此PIR问题的容量）。我们的结果表明，该容量与没有私有侧信息的多消息PIR问题的容量相同，但具有减小的库大小。库的有效大小等于原始库大小减去边信息的大小。
We consider the problem of private information retrieval (PIR) where a single user with private side information aims to retrieve multiple files from a library stored (uncoded) at a number of servers. We assume the side information at the user includes a subset of files stored privately (i.e., the server does not know the indices of these files). In addition, we require that the identity of requests and side information at the user are not revealed to any of the servers. The problem involves finding the minimum load to be transmitted from the servers to the user such that the requested files can be decoded with the help of received and side information. By providing matching lower and upper bounds, for certain regimes, we characterize the minimum load imposed to all the servers (i.e., the capacity of this PIR problem). Our result shows that the capacity is the same as the capacity of a multi-message PIR problem without private side information, but with a library of reduced size. The effective size of the library is equal to the original library size minus the size of side information.
影响因子：
2.5
作者：
Hua Sun;S. Jafar
通讯作者：
Hua Sun;S. Jafar
影响因子：
2.5
作者：
Karim A. Banawan;S. Ulukus
通讯作者：
Karim A. Banawan;S. Ulukus