arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2106.07534cs.CRcs.DS
收藏

z-anonymity:数据流的零延迟分析

z-anonymity: Zero-Delay Anonymization for Data Streams

Nikhil Jha, Thomas Favale, Luca Vassio, Martino Trevisan, Marco Mellia

摘要:

随着大数据的出现和出售个人信息的数据市场的诞生,个人隐私至关重要。经典的反应是匿名化,即,对可以直接或间接允许用户重新识别的信息进行净化。文献中最流行的解决方案是k-匿名。然而,它是很难实现的k-匿名的连续数据流,以及当维数变高。在本文中,我们提出了一种新的匿名属性称为z-匿名。与k-匿名性类似,它可以在数据流上实现零延迟,并且非常适合高维数据。z-匿名的基本思想是,只有当至少z - 1个其他用户在过去的时间窗口中呈现了相同的属性时,才发布关于用户的属性(原子信息)。z-匿名性比k-匿名性弱,因为它不对属性的组合起作用,而是单独对待它们。在本文中,我们提出了一个概率框架,以映射的z-匿名到k-匿名属性。我们的研究结果表明,适当选择z-匿名参数可以让数据管理员以精确可测量的概率获得k-匿名数据集。我们还评估了一个真实的用例,在该用例中,我们考虑了一个用户群体的网站访问,并表明z-匿名也可以在实践中获得k-匿名。

英文摘要:

With the advent of big data and the birth of the data markets that sell personal information, individuals' privacy is of utmost importance. The classical response is anonymization, i.e., sanitizing the information that can directly or indirectly allow users' re-identification. The most popular solution in the literature is the k-anonymity. However, it is hard to achieve k-anonymity on a continuous stream of data, as well as when the number of dimensions becomes high.In this paper, we propose a novel anonymization property called z-anonymity. Differently from k-anonymity, it can be achieved with zero-delay on data streams and it is well suited for high dimensional data. The idea at the base of z-anonymity is to release an attribute (an atomic information) about a user only if at least z - 1 other users have presented the same attribute in a past time window. z-anonymity is weaker than k-anonymity since it does not work on the combinations of attributes, but treats them individually. In this paper, we present a probabilistic framework to map the z-anonymity into the k-anonymity property. Our results show that a proper choice of the z-anonymity parameters allows the data curator to likely obtain a k-anonymized dataset, with a precisely measurable probability. We also evaluate a real use case, in which we consider the website visits of a population of users and show that z-anonymity can work in practice for obtaining the k-anonymity too.

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

↑