We consider the problem of weakly-private information retrieval (WPIR) when data is encoded by a maximum distance separable code and stored across multiple servers. In WPIR, a user wishes to retrieve a piece of data from a set of servers without leaking too much information about which piece of data she is interested in. We study and provide the first WPIR protocols for this scenario and present results on their optimal trade-off between download rate and information leakage using the maximal leakage privacy metric.

翻译：本文研究当数据采用最大距离可分码编码并存储于多服务器时的弱私密信息检索问题。在弱私密信息检索场景中，用户期望从服务器集合中检索某数据片段，同时避免过度泄露其所关注的具体数据信息。我们针对该场景首次提出了弱私密信息检索协议，并基于最大泄漏隐私度量方法，给出了下载速率与信息泄露之间最优权衡的研究结果。