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

具有小下载复杂度和低存储要求的PIR方案

PIR schemes with small download complexity and low storage requirements

Simon R. Blackburn, Tuvi Etzion, Maura B. Paterson

摘要:

在(信息理论上安全的)私有信息检索(PIR)的经典模型中,用户希望检索存储在一组$n$服务器上的数据库的一个位,以这样的方式,没有单独的服务器获得关于用户对哪个位感兴趣的信息。目的是设计最大限度地减少用户和服务器之间通信的方案。最近,已经有考虑更现实的模型的动作,其中服务器集合的总存储或每服务器存储应该被最小化(可能使用来自分布式存储的技术),并且其中数据库被划分为具有$R>1$的$R$位记录,并且用户希望检索一个记录而不是一个位。当$R$很大时,从服务器到用户的下载支配着通信复杂性,因此目的是最小化下载比特的总数。Shah,Rashmi和Ramchandran表明,在最坏的情况下,必须从服务器下载至少$R+1$位,并提供满足此约束的PIR方案。Sun和Jafar确定了PIR方案的最佳渐近下载成本(作为$R\rightarrow\infty$),其中该成本定义为消息长度$R$与下载的总比特数之比。本文提供了PIR方案的下载复杂性的各种界限,将Shah等人的那些推广到服务器的数量$n$有界的情况,并提供了与Chor等人的经典技术的链接。本文还提供了一系列比以前已知的方案更简单或性能更好的PIR方案的构造,包括实现Sun和Jafar的最佳渐近下载复杂度而具有显著较低的上载复杂度的显式方案,以及用于从平均具有良好下载复杂度的方案构造具有良好最坏情况下载复杂度的方案的一般技术。

英文摘要:

In the classical model for (information theoretically secure) Private Information Retrieval (PIR), a user wishes to retrieve one bit of a database that is stored on a set of $n$ servers, in such a way that no individual server gains information about which bit the user is interested in. The aim is to design schemes that minimise communication between the user and the servers. More recently, there have been moves to consider more realistic models where the total storage of the set of servers, or the per server storage, should be minimised (possibly using techniques from distributed storage), and where the database is divided into $R$-bit records with $R>1$, and the user wishes to retrieve one record rather than one bit. When $R$ is large, downloads from the servers to the user dominate the communication complexity and so the aim is to minimise the total number of downloaded bits. Shah, Rashmi and Ramchandran show that at least $R+1$ bits must be downloaded from servers in the worst case, and provide PIR schemes meeting this bound. Sun and Jafar determine the best asymptotic download cost of a PIR scheme (as $R\rightarrow\infty$), where this cost is defined as the ratio of the message length $R$ and the total number of bits downloaded. This paper provides various bounds on the download complexity of a PIR scheme, generalising those of Shah et al. to the case when the number $n$ of servers is bounded, and providing links with classical techniques due to Chor et al. The paper also provides a range of constructions for PIR schemes that are either simpler or perform better than previously known schemes, including explicit schemes that achieve the best asymptotic download complexity of Sun and Jafar with significantly lower upload complexity, and general techniques for constructing a scheme with good worst case download complexity from a scheme with good download complexity on average.

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

↑