Private information storage (extended abstract)
Private information storage (extended abstract)
复制标题
私有信息存储（扩展摘要）
DOI：
10.1145/258533.258606
复制
发表时间：
1997
影响因子：
0.3
通讯作者：
V. Shoup
中科院分区：
文献类型：
--
作者：
R. Ostrovsky;V. Shoup
这篇论文处理的问题是有效地和私有地存储和检索信息，这些信息分布在几个互不通信的数据库中。目标是在保持隐私的同时最小化通信复杂性（即，使单个数据库无法获得有关数据或用户查询性质的任何信息）。Chor, Goldreich， Kushilevitz和Sudan在一篇非常好的论文（FOCS ' 95）中介绍了从多个数据库中进行私人检索的问题，但是否有可能以一种有效的通信方式同时进行读写的问题仍然没有解决。在本文中，我们肯定地回答了这个问题，并表明高效的读/写方案确实是可能的。事实上，我们展示了从读写到任何只读方案的一般信息理论缩减，该方案将读方案的通信复杂性保留在一个多对数因子（数据库的大小）内，从而建立了读/写方案可以像只读方案一样有效地实现（最多为多对数因子）。此外，我们考虑了在计算安全设置中读取和写入的问题。
Rafail Ostrovsky” Victor Shoupt Belicore Bellcore, IBM This paper deals with the problem of efficiently and privately storing and retrieving information that is distributively maintained in several databases that do not communicate with one another. The goal is to minimize the communication complexity while maintaining privacy (i.e., so that individual databases do not get any information about the data or the nature of the users’ queries). The question of private retrieval from multiple databases was introduced in a very nice paper of Chor, Goldreich, Kushilevitz and Sudan (FOCS ’95), but the question whether it is possible to perform both reading and writing in a communication-efficient manner remained open. In this paper, we answer this question in the affirmative, and show that efficient read/ write schemes are indeed possible. In fact, we show a general information-theoretic reduction from reading and writing to any read-only scheme that preserves the communication complexity of the read scheme to within a poly-logarithmic factor (in the size of the database), thus establishing that read/ write schemes could be implemented as efficiently (up to poly-log factors) as read-onfy schemes. .Additionally, we consider the question of both reading and writing in the computational security setting.