arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.08582cs.ITcs.IRmath.IT
收藏

计算受限数据库的多用户私有信息检索容量

The Capacity of Multi-user Private Information Retrieval for Computationally Limited Databases

William Barnhart, Zhi Tian

摘要:

我们提出了一个私人信息检索(PIR)计划,允许用户检索一个单一的消息从任意数量的数据库与其他用户勾结,同时隐藏所需的消息索引。当只有一个可访问的数据库时,该方案具有特别重要的意义-这是一种特殊情况,在多数据库的情况下对PIR更具挑战性。这些场景的隐私保护容量上限是$C=(1+\frac{1}{S}+\cdots+\frac{1}{S^{K-1}})^{-1}$,其中$K$是消息的数量,$S$表示信息源的数量,例如$U$用户和$N$数据库的$S=N+U-1$。我们表明,所提出的信息检索计划达到的容量限制,即使只有一个数据库是存在的,这不同于大多数现有的作品,铰链上访问多个数据库,以隐藏用户隐私。与多数据库的情况不同,该方案利用了数据库由于计算复杂性而不能交叉引用多个用户进行的查询。

英文摘要:

We present a private information retrieval (PIR) scheme that allows a user to retrieve a single message from an arbitrary number of databases by colluding with other users while hiding the desired message index. This scheme is of particular significance when there is only one accessible database -- a special case that turns out to be more challenging for PIR in the multi-database case. The upper bound for privacy-preserving capacity for these scenarios is $C=(1+\frac{1}{S}+\cdots+\frac{1}{S^{K-1}})^{-1}$, where $K$ is the number of messages and $S$ represents the quantity of information sources such as $S=N+U-1$ for $U$ users and $N$ databases. We show that the proposed information retrieval scheme attains the capacity bound even when only one database is present, which differs from most existing works that hinge on the access to multiple databases in order to hide user privacy. Unlike the multi-database case, this scheme capitalizes on the inability for a database to cross-reference queries made by multiple users due to computational complexity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑