关键词: 加权社会网络, 路径隐私, 权重泛化, 最短路径

Abstract: With the popularity of social networks, data privacy preserving in social networks has become a hot issue among scholars. Since the broad privacy information, an adversary can use a variety of background knowledge to attack against privacy. Most of the present technology on privacy preservation can deal with simple graphs only, and cannot be applied to weighted graphs. This paper investigates the path privacy disclosure problem in weighted graph, proposes weighted graph k-possible path anonymity (KPPA) to protect against shortest-path-based attacks on shortest path identification, and develops a weight generalization based approach to achieve KPPA algorithm. Extensive experiments on real data sets show that the algorithm performs well. Meanwhile, it can retain the structural properties of the original graph and increase the utility of the weight information.

Key words:  weighted social networks, path privacy, weight generalization, shortest path