发布更多更新:迈向完全动态数据集的匿名重新发布
Challenging More Updates: Towards Anonymous Re-publication of Fully Dynamic Datasets
摘要:
大多数现有的匿名化工作都是在静态数据集上完成的,这些数据集没有更新,只需要一次性发布。最近的研究考虑匿名化动态数据集与外部更新:数据集更新记录插入和/或删除。本文解决了一个新的问题:匿名重新发布的数据集与内部更新,其中每个记录的属性值是动态更新的。这是一个重要的和具有挑战性的问题,因为在实践中,记录的属性值经常更新,现有的方法无法处理这样的情况。我们发起了一个正式的研究匿名重新发布的动态数据集与内部更新,并显示现有的方法无效。我们介绍了动态数据集的理论定义和分析,并提出了一个通用的隐私披露框架,适用于所有的匿名重新发布问题。我们提出了一个新的伪造泛化原则称为m-Distinct,以有效地匿名数据集与外部更新和内部更新。我们还开发了一个算法来概括数据集,以满足m-Distinct。在真实数据上进行的实验证明了该方法的有效性。
英文摘要:
Most existing anonymization work has been done on static datasets, which have no update and need only one-time publication. Recent studies consider anonymizing dynamic datasets with external updates: the datasets are updated with record insertions and/or deletions. This paper addresses a new problem: anonymous re-publication of datasets with internal updates, where the attribute values of each record are dynamically updated. This is an important and challenging problem for attribute values of records are updating frequently in practice and existing methods are unable to deal with such a situation. We initiate a formal study of anonymous re-publication of dynamic datasets with internal updates, and show the invalidation of existing methods. We introduce theoretical definition and analysis of dynamic datasets, and present a general privacy disclosure framework that is applicable to all anonymous re-publication problems. We propose a new counterfeited generalization principle alled m-Distinct to effectively anonymize datasets with both external updates and internal updates. We also develop an algorithm to generalize datasets to meet m-Distinct. The experiments conducted on real-world data demonstrate the effectiveness of the proposed solution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。