arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.07955cs.CR
收藏

基于非对称噪声的差分隐私距离查询

Differentially Private Distance Query with Asymmetric Noise

Weihong Sheng, Jiajun Chen, Chunqiang Hu, Bin Cai, Meng Han, Jiguo Yu

AI总结:

针对社交图距离发布的隐私保护需求,本文提出基于边差分隐私的非对称噪声距离查询机制,结合平滑敏感性提升效用,实验验证其可将误差降至0.0862。

摘要:

随着在线社交服务的发展,社交信息图日益复杂,社交图分析或发布相关的隐私问题也愈发严峻。由于最短路径在图中具有重要作用,隐私化发布最短路径或距离的研究受到了研究者的关注。差分隐私(Differential Privacy, DP)是一种优秀的隐私保护标准,但现有满足DP保证的距离查询研究几乎都基于权重私有图假设,而非针对路径本身。本文将边视为隐私对象,提出基于边DP的距离发布机制。为解决全局敏感性过大导致的效用损失问题,本文结合距离查询在非对称邻域中具有单调性的观察,重新梳理了DP中非对称邻域的相关研究。本文正式给出非对称邻域的定义,结合平滑敏感性提出具备更高隐私保证的个体非对称差分隐私(Individual Asymmetric Differential Privacy)。随后,本文介绍了两种高效计算非对称邻域中距离查询平滑敏感性的方法。最后,本文在真实数据集和合成数据集上验证了所提方案,该方案可将误差降至0.0862。

英文摘要:

With the growth of online social services, social information graphs are becoming increasingly complex. Privacy issues related to analyzing or publishing on social graphs are also becoming increasingly serious. Since the shortest paths play an important role in graphs, privately publishing the shortest paths or distances has attracted the attention of researchers. Differential privacy (DP) is an excellent standard for preserving privacy. However, existing works to answer the distance query with the guarantee of DP were almost based on the weight private graph assumption, not on the paths themselves. In this paper, we consider edges as privacy and propose distance publishing mechanisms based on edge DP. To address the issue of utility damage caused by large global sensitivities, we revisit studies related to asymmetric neighborhoods in DP with the observation that the distance query is monotonic in asymmetric neighborhoods. We formally give the definition of asymmetric neighborhoods and propose Individual Asymmetric Differential Privacy with higher privacy guarantees in combination with smooth sensitivity. Then, we introduce two methods to efficiently compute the smooth sensitivity of distance queries in asymmetric neighborhoods. Finally, we validate our scheme using both real-world and synthetic datasets, which can reduce the error to $0.0862$.

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

↑