arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.6692cs.CCcs.CRcs.IR
收藏

2-具有子多项式通信的服务器PIR

2-Server PIR with sub-polynomial communication

Zeev Dvir, Sivakanth Gopi

摘要:

2服务器私有信息检索(PIR)方案允许用户检索在两个服务器(它们不通信)之间复制的$n$位数据库的第$i$位,同时不向任一服务器泄露关于$i$的任何信息。在这项工作中,我们构建了一个1轮2服务器PIR的总通信成本$n^{O({\sqrt{\log\log n/\log n}})}$。这改进了当前已知的需要$O(n^{1/3})$通信的2-服务器协议,并且与已知的3-服务器PIR方案的通信成本相匹配。我们的改进来自于减少现有协议中的服务器数量,基于匹配向量码,从3或4台服务器减少到2台。这是通过以代数方式(使用多项式插值)查看这些协议并使用偏导数扩展它们来实现的。

英文摘要:

A 2-server Private Information Retrieval (PIR) scheme allows a user to retrieve the $i$th bit of an $n$-bit database replicated among two servers (which do not communicate) while not revealing any information about $i$ to either server. In this work we construct a 1-round 2-server PIR with total communication cost $n^{O({\sqrt{\log\log n/\log n}})}$. This improves over the currently known 2-server protocols which require $O(n^{1/3})$ communication and matches the communication cost of known 3-server PIR schemes. Our improvement comes from reducing the number of servers in existing protocols, based on Matching Vector Codes, from 3 or 4 servers to 2. This is achieved by viewing these protocols in an algebraic way (using polynomial interpolation) and extending them using partial derivatives.

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

↑