The Capacity of Multi-user Private Information Retrieval for Computationally Limited Databases
The Capacity of Multi-user Private Information Retrieval for Computationally Limited Databases
复制标题
计算受限数据库的多用户私有信息检索能力
DOI：
10.1109/uemcon51285.2020.9298136
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Tian, Zhi
中科院分区：
文献类型：
--
作者：
Barnhart, William;Tian, Zhi
我们提出了一种私有信息检索（PIR）方案，该方案允许用户在隐藏所需消息索引的同时与其他用户串通，从任意数量的数据库中检索单个消息。当只有一个可访问的数据库时，这种方案特别重要——在多数据库情况下，这种特殊情况对PIR来说更具挑战性。这些场景的隐私保护容量上限为，其中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, 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.
带辅助信息的单服务器多用户隐私信息检索
DOI：
10.1109/isit.2018.8437545
发表时间：
2018
期刊：
2018 IEEE International Symposium on Information Theory (ISIT)
影响因子：
--
作者：
Su Li;M. Gastpar
通讯作者：
M. Gastpar