稀疏图的平滑匿名性
Smooth Anonymity for Sparse Graphs
AI总结:
本研究针对稀疏数据集共享中差分隐私机制隐私保障弱的问题,提出smooth-$k$-anonymity概念及对应大规模算法,经实证验证可提升匿名数据的下游ML任务性能。
摘要:
在处理用户数据时,提供明确的隐私保障至关重要。本研究旨在对完整稀疏数据集进行处理并隐私地共享给第三方。事实上,差分隐私已成为隐私保护的黄金标准,但我们的核心结果之一证明:在共享稀疏数据集(如稀疏网络)的场景下,任何能与原始数据集保持合理相似度的差分隐私机制,都必然只能提供非常弱的隐私保障。在这类场景中,我们需要研究其他隐私概念,例如$k$-匿名性。本研究提出了一种$k$-匿名性的变体,我们称之为smooth-$k$-anonymity(平滑$k$-匿名性),并设计了可高效实现平滑$k$-匿名性的简单大规模算法。我们进一步开展了实证评估以支撑理论保证,结果表明该算法提升了匿名化数据在下游机器学习任务中的性能。
英文摘要:
When working with user data providing well-defined privacy guarantees is paramount. In this work, we aim to manipulate and share an entire sparse dataset with a third party privately. In fact, differential privacy has emerged as the gold standard of privacy, however, when it comes to sharing sparse datasets, e.g. sparse networks, as one of our main results, we prove that \emph{any} differentially private mechanism that maintains a reasonable similarity with the initial dataset is doomed to have a very weak privacy guarantee. In such situations, we need to look into other privacy notions such as $k$-anonymity. In this work, we consider a variation of $k$-anonymity, which we call smooth-$k$-anonymity, and design simple large-scale algorithms that efficiently provide smooth-$k$-anonymity. We further perform an empirical evaluation to back our theoretical guarantees and show that our algorithm improves the performance in downstream machine learning tasks on anonymized data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。