We study the problem of intermittent private information retrieval with multiple servers, in which a user consecutively requests one of K messages from N replicated databases such that part of requests need to be protected while others do not need privacy. Because of the correlation between requests, the user cannot simply ignore the privacy for the non-private requests. We start by studying a basic two-requests system where one request is private and the other is non-private. We propose a scheme for any correlation structure between two requests, which concatenates an obfuscation scheme and a standard PIR scheme to prevent leakage when retrieving information for the non-private request. The general problem beyond two-requests would require a specification of the correlation structure. Motivated by the location privacy application, we study the Markov model as the correlation structure. To be concrete, we study the problem in the context of location privacy and we apply the basic two-requests intermittent private information retrieval scheme as a building block to design a location privacy protection mechanism that preserves privacy for locations in the trace level.
翻译:我们研究的是间歇性私人信息检索与多个服务器的问题,用户在其中连续请求从N复制的数据库中获取K级信息,因此部分请求需要保护,而其他人不需要隐私。由于请求之间的相互关系,用户不能简单地忽视非私人请求的隐私。我们首先研究一个请求是私人请求而另一个请求是非私人请求的基本两个请求系统。我们为两个请求之间的任何关联结构提出了一个计划,其中结合了一个混淆计划和一个标准的PIR计划,以防止在为非私人请求检索信息时出现渗漏。除两个请求外,一般问题还需要说明相关结构。我们受地点隐私应用程序的驱动,我们研究Markov模式作为关联结构。具体地说,我们从地点隐私的角度研究该问题,我们应用基本两个请求的间歇性私人信息检索计划,作为设计一个地点隐私保护机制的建筑块,以维护追踪级别的地点的隐私。