论文标题
单人弱私人信息检索的能力
The Capacity of Single-Server Weakly-Private Information Retrieval
论文作者
论文摘要
私人信息检索(PIR)协议可确保用户可以私下检索存储在数据库中的文件,而无需揭示有关请求文件身份的任何信息。现有的信息理论PIR协议可确保完美的隐私,即向存储数据库的服务器的零信息泄漏,但以高下载为代价。在这项工作中,我们提出了弱势私人信息检索(WPIR)方案,这些方案将在数据库存储在单个服务器上时进行完美的隐私权以提高下载成本。我们研究下载成本与信息泄漏之间的权衡,从共同信息(MI)和最大泄漏(MAXL)隐私指标方面进行了权衡。通过将WPIR问题与速度延伸理论联系起来,下载透明功能定义为所有单人服务器WPIR计划的最低下载成本,以提供给定的信息泄漏和固定文件大小。通过表征MI和MAXL指标的下载透明功能,可以充分描述单人wpir的容量。
A private information retrieval (PIR) protocol guarantees that a user can privately retrieve files stored in a database without revealing any information about the identity of the requested file. Existing information-theoretic PIR protocols ensure perfect privacy, i.e., zero information leakage to the servers storing the database, but at the cost of high download. In this work, we present weakly-private information retrieval (WPIR) schemes that trade off perfect privacy to improve the download cost when the database is stored on a single server. We study the tradeoff between the download cost and information leakage in terms of mutual information (MI) and maximal leakage (MaxL) privacy metrics. By relating the WPIR problem to rate-distortion theory, the download-leakage function, which is defined as the minimum required download cost of all single-server WPIR schemes for a given level of information leakage and a fixed file size, is introduced. By characterizing the download-leakage function for the MI and MaxL metrics, the capacity of single-server WPIR is fully described.