Social network k degree anonymity privacy protection method
Social network data publishing can lead to privacy breaches,and attackers can use background knowledge to infer the identity of nodes.In order to reduce information loss,this paper presents a k degree anonymous privacy protection method based on the objective degree of social network nodes.The method first sorts the degree sequence of nodes in a non-increasing order,uses a dynamic programming algorithm to group the degree sequence,calculates the objective degree with the lowest anonymity cost in the group,changes the degree of nodes in the group to the objective degree with the lowest anonymity cost,and constructs the k degree anonymous sequence.Then,using the priority construction method,the k degree anonymous graph is constructed by preferentially preserving the existing edges in the original graph.The experimental results show that the proposed method has less information loss,successfully resists the identity attack based on node degree as background knowledge,and realizes the protection of social network privacy.
NETL
NSTL
万方数据
