论文标题
在任意勾结模式下检索私人信息的能力
The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns
论文作者
论文摘要
我们研究了复制数据库的任意勾结模式下的私人信息检索（PIR）问题。我们找到了其容量，与原始PIR问题的容量相同，而数据库数量$ n $被数字$ s^*$代替。数字$ s^*$是线性编程问题的最佳解决方案，该解决方案是勾结模式的函数。因此，勾结模式仅通过数字$ s^*$影响PIR问题的容量。
We study the private information retrieval (PIR) problem under arbitrary collusion pattern for replicated databases. We find its capacity, which is the same as the capacity of the original PIR problem with the number of databases $N$ replaced by a number $S^*$. The number $S^*$ is the optimal solution to a linear programming problem that is a function of the collusion pattern. Hence, the collusion pattern affects the capacity of the PIR problem only through the number $S^*$.
