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

利用差分隐私保护路径发布中的边缘隐私

Protect Edge Privacy in Path Publishing with Differential Privacy

Zhigang Lu, Hong Shen

摘要:

给定网络中的路径是许多现实应用中时间序列链的一般形式,例如轨迹和互联网流。不同的私有轨迹发布涉及发布路径信息,该路径信息对于真实用户是可用的,但对于对手是安全的,以利用最大的背景知识来重建路径。现有的研究都假设这种知识是路径上除一个顶点之外的所有顶点,为了防止攻击者恢复丢失的信息,他们发布了一条扰动路径,其中每个顶点都是从一个具有差分隐私(DP)的预定义集合中采样的,以替换原始路径中的对应顶点。并且因此考虑更强大的对手具有整个网络拓扑和路径(包括所有顶点)的最大背景知识(除了一个(任意的)丢失边缘)的情况。在这种假设下,现有工作产生的扰动路径是脆弱的,因为对手可以从扰动路径中的边的存在来重建丢失的边。为了解决这个脆弱性并有效地保护边隐私,而不是发布扰动路径,我们提出了一种新的图形方案,基于路径发布,通过应用差分隐私将路径嵌入到包含伪边和复制顶点的图中来保护原始路径技术,使得只有具有网络拓扑的全部知识的合法用户能够以高概率恢复原始路径的精确顶点和边缘。我们从理论上分析了我们的算法在差分隐私,效用和执行效率方面的性能。我们还进行了广泛的高性能集群系统的实验评估,以验证我们的分析结果。

英文摘要:

Paths in a given network are a generalised form of time-serial chains in many real-world applications, such as trajectories and Internet flows. Differentially private trajectory publishing concerns publishing path information that is usable to the genuine users yet secure against adversaries to reconstruct the path with maximum background knowledge. The exiting studies all assume this knowledge to be all but one vertex on the path. To prevent the adversaries recovering the missing information, they publish a perturbed path where each vertex is sampled from a pre-defined set with differential privacy (DP) to replace the corresponding vertex in the original path. In this paper, we relax this assumption to be all but one edge on the path, and hence consider the scenario of more powerful adversaries with the maximum background knowledge of the entire network topology and the path (including all the vertices) except one (arbitrary) missing edge. Under such an assumption, the perturbed path produced by the existing work is vulnerable, because the adversary can reconstruct the missing edge from the existence of an edge in the perturbed path. To address this vulnerability and effectively protect edge privacy, instead of publishing a perturbed path, we propose a novel scheme of graph-based path publishing to protect the original path by embedding the path in a graph that contains fake edges and replicated vertices applying the differential privacy technique, such that only the legitimate users who have the full knowledge of the network topology are able to recover the exact vertices and edges of the original path with high probability. We theoretically analyse the performance of our algorithm in differential privacy, utility, and execution efficiency. We also conduct extensive experimental evaluations on a high-performance cluster system to validate our analytical results.

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

↑