Private Information Retrieval for Secure Distributed Storage Systems
Private Information Retrieval for Secure Distributed Storage Systems
复制标题
DOI：
10.1109/tifs.2018.2833050
复制
发表时间：
2018-05
影响因子：
6.8
通讯作者：
Heecheol Yang;W. Shin;Jungwoo Lee
中科院分区：
文献类型：
--
作者：
Heecheol Yang;W. Shin;Jungwoo Lee
在本文中，我们研究了在窃听器的存在下，针对安全的分布式存储系统的私人信息检索（PIR）问题。我们设计了安全的分布式数据库和相应的PIR方案，该计划不仅保护用户隐私（隐藏所需消息的索引）免受数据库的影响，还可以保护数据安全性（本身隐藏消息本身）免受窃听器的影响。在我们提出的计划中，我们使用秘密共享方案在每个数据库中存储数据安全性。我们考虑了两个不同的方案，即数据库是否知道其他数据库中存储的秘密共享的索引集。设计有效的PIR程序的关键思想是通过将秘密股份存储在多个数据库中，利用不希望的消息的秘密股份作为附带信息。特别是，发现所提出的PIR方案的速率在PIR问题的能力上的衍生上限范围内属于恒定的乘法因子。
In this paper, we investigate a private information retrieval (PIR) problem for secure distributed storage systems in the presence of an eavesdropper. We design the secure distributed database and the corresponding PIR scheme, which protect not only user privacy (concealing the index of the desired message) from the databases, but also data security (concealing the messages themselves) from an eavesdropper. In our proposed scheme, we use a secret sharing scheme in storing the messages for data security at each of the databases. We consider two different scenarios on whether the databases are aware of the index sets of the secret shares stored in other databases. The key idea in designing an efficient PIR procedure is to exploit the secret shares of undesired messages as a side information by means of storing the secret shares at multiple databases. In particular, it is shown that the rates of the proposed PIR schemes are within a constant multiplicative factor from the derived upper-bound on the capacity of PIR problem.