关键词: 社交网络, 隐私保护, [k]-度匿名, 优先级算法, 邻居度序列, 欧式距离

Abstract: Aiming at the problem of traditional [k]-degree methods which usually add a huge amount of random noise, have low success rate in re-constructing graph and cannot resist attacks based on more complex background knowledge of graph query, an advanced [k]-degree scheme is presented for preserving privacy. The scheme brings up the priority algorithm for constructing graph, adjusts the weights between neighborhood of nodes and the highest demand node by setting some parameters and introduces Euclidean distance to construct similar neighborhood degree sequence of nodes with the same degree after anonymity. Experimental results show that this scheme has less degree loss and can regulate collision between information loss and success rate of constructing graph, resist attacks about combining background knowledge of degree of nodes and their neighborhood degree sequence.

Key words: social networks, preserving privacy, [k]-degree anonymity, priority algorithm, neighborhood degree sequence, Euclidean distance