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. Motivated by the location privacy application, the correlation between requests is modeled by a Markov chain. We propose an intermittent private information retrieval scheme that concatenates an obfuscation scheme and a private information retrieval scheme for the time period when privacy is not needed, to prevent leakage incurred by the correlation over time. In the end, we illustrate how the proposed scheme for the problem of intermittent private information retrieval with Markov structure correlation can be applied to design a location privacy protection mechanism in the location privacy problem.
翻译:我们研究的是间歇性私人信息检索和多个服务器的问题,用户在其中连续请求从N复制的数据库中获取K级信息,因此部分请求需要保护,而其他人则不需要隐私。受地点隐私应用程序的驱使,请求之间的相互关系由Markov链制成。我们建议采用间歇性私人信息检索计划,在不需要隐私的时期将隐蔽计划与私人信息检索计划混为一体,以防止因相关时间而发生渗漏。最后,我们说明如何应用拟议的与Markov结构关联的间歇性私人信息检索问题办法,在地点隐私问题中设计地点隐私保护机制。