Private Proximity Retrieval
Private Proximity Retrieval
复制标题
DOI：
10.1109/isit.2019.8849249
复制
发表时间：
2019-07
期刊：
影响因子：
--
通讯作者：
T. Etzion;O. W. Gnilke;David A. Karpuk;Eitan Yaakobi;Yiwei Zhang
中科院分区：
文献类型：
--
作者：
T. Etzion;O. W. Gnilke;David A. Karpuk;Eitan Yaakobi;Yiwei Zhang
私人检索（PPR）方案是一个协议，该协议可以在用户的记录x范围内检索数据库中的所有记录的身份。在本文中，启动了这项研究，这是在记录是二进制媒介和锤子距离的情况下，在本文中提供了折衷。
A private proximity retrieval (PPR) scheme is a protocol which allows a user to retrieve the identities of all records in a database that are within some distance r from the user’s record x. The user’s privacy at each server is given by the fraction of the record x that is kept private. The distortion of a PPR scheme measures how accurately the user can calculate the identities of the desired files. We assume that each server stores a copy of the database. This paper studies protocols that offer trade-offs between perfect privacy and low computational complexity and storage.In this paper, this study is initiated. The work focuses on the case when the records are binary vectors together with the Hamming distance. In particular, for a given privacy level, we investigate the minimum number of servers that guarantee a prescribed distortion value. The collusions of pairs of servers as well as other distance measures are investigated.