Private Information Retrieval With Private Noisy Side Information

Private Information Retrieval With Private Noisy Side Information
复制标题

DOI:
10.1109/tit.2024.3363133
复制
发表时间:
2023-08
影响因子:
2.5
通讯作者:
Hassan ZivariFard;Rémi A. Chou
Hassan ZivariFard;Rémi A. Chou
中科院分区:
计算机科学2区
文献类型:
--
作者:
Hassan ZivariFard;Rémi A. Chou

文献摘要

相似文献

考虑专用信息检索(PIR),其中客户端希望从在$N$个不同服务器上复制的$K$个文件中检索一个文件,并且当多达$T$个服务器可能串通时,客户端选择必须保持私有。此外,假设客户端具有关于每个$K$文件的嘈杂的辅助信息,并且通过通过$D$可能的离散无记忆测试通道之一传递该文件来获得关于特定文件的辅助信息,其中$D\le K$。虽然客户端和所有服务器都知道测试通道的统计信息,但服务器不知道文件和测试通道之间的特定映射$\boldsign{\mathcal{M}}$。我们在两种不同的隐私度量下研究了这个问题。在第一个隐私度量下,客户端希望保留其所需文件选择和映射$\boldsign{\mathcal{M}}$的隐私。在第二隐私度量下,客户端希望保护其所需文件和映射$\boldsign{\mathcal{M}}$的隐私,但愿意揭示与其所需文件相关联的测试频道的索引。对于这两个隐私度量,我们都得到了最优的归一化下载成本。我们的问题设置概括了具有合谋服务器的PIR、具有私有无声辅助信息的PIR以及具有存储限制的私有辅助信息的PIR。
Consider Private Information Retrieval (PIR), where a client wants to retrieve one file out of $K$ files that are replicated in $N$ different servers and the client selection must remain private when up to $T$ servers may collude. Additionally, suppose that the client has noisy side information about each of the $K$ files, and the side information about a specific file is obtained by passing this file through one of $D$ possible discrete memoryless test channels, where $D\le K$ . While the statistics of the test channels are known by the client and by all the servers, the specific mapping $\boldsymbol { \mathcal {M}}$ between the files and the test channels is unknown to the servers. We study this problem under two different privacy metrics. Under the first privacy metric, the client wants to preserve the privacy of its desired file selection and the mapping $\boldsymbol { \mathcal {M}}$ . Under the second privacy metric, the client wants to preserve the privacy of its desired file and the mapping $\boldsymbol { \mathcal {M}}$ but is willing to reveal the index of the test channel that is associated to its desired file. For both of these two privacy metrics, we derive the optimal normalized download cost. Our problem setup generalizes PIR with colluding servers, PIR with private noiseless side information, and PIR with private side information under storage constraints.