arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.06404cs.ITmath.IT
收藏

贝叶斯时间序列匹配中隐私性的渐近极限

Asymptotic Limits of Privacy in Bayesian Time Series Matching

Nazanin Takbiri, Dennis L. Goeckel, Amir Houmansadr, Hossein Pishro-Nik

摘要:

各种现代的和高度流行的应用利用用户数据跟踪以便提供特定的服务,通常是为了在使用这样的应用时改善用户的体验。然而,即使当用户数据通过采用隐私保护机制(PPM)而被私有化时,用户的隐私仍然可能被利用统计匹配方法来将用户的踪迹与他们先前的活动相匹配的外部方损害。在本文中,我们获得了用户隐私的理论界的情况下,用户的痕迹是匹配的序列的先前的行为,尽管匿名化的数据时间序列。对于每个用户的数据轨迹由独立同分布(i.i.d.)从多项分布中抽取的随机样本,以及用户的数据点随时间而变化并且每个用户的数据轨迹由马尔可夫链模型管理的情况。

英文摘要:

Various modern and highly popular applications make use of user data traces in order to offer specific services, often for the purpose of improving the user's experience while using such applications. However, even when user data is privatized by employing privacy-preserving mechanisms (PPM), users' privacy may still be compromised by an external party who leverages statistical matching methods to match users' traces with their previous activities. In this paper, we obtain the theoretical bounds on user privacy for situations in which user traces are matchable to sequences of prior behavior, despite anonymization of data time series. We provide both achievability and converse results for the case where the data trace of each user consists of independent and identically distributed (i.i.d.) random samples drawn from a multinomial distribution, as well as the case that the users' data points are dependent over time and the data trace of each user is governed by a Markov chain model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑