首页|MLDA:a multi-level k-degree anonymity scheme on directed social network graphs
MLDA:a multi-level k-degree anonymity scheme on directed social network graphs
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
With the emergence of network-centric data,social network graph publishing is conducive to data analysts to mine the value of social networks,analyze the social behavior of individuals or groups,implement personalized recommenda-tions,and so on.However,published social network graphs are often subject to re-identification attacks from adversaries,which results in the leakage of users'privacy.The k-anonymity technology is widely used in the field of graph publishing,which is quite effective to resist re-identification attacks.However,the current researches still exist some issues to be solved:the protection of directed graphs is less concerned than that of undirected graphs;the protection of graph structure is often ignored while achieving the protection of nodes'identities;the same protection is performed for different users,which doesn't meet the different privacy requirements of users.Therefore,to address the above issues,a multi-level k-degree anonymity(MLDA)scheme on directed social network graphs is proposed in this paper.First,node sets with different importance are divided by the firefly algorithm and constrained connectedness upper approximation,and they are performed different k-degree anonymity protection to meet the different privacy requirements of users.Second,a new graph anonymity method is proposed,which achieves the addition and removal of edges with the help of fake nodes.In addition,to improve the utility of the anonymized graph,a new edge cost criterion is proposed,which is used to select the most appropriate edge to be removed.Third,to protect the community structure of the original graph as much as possible,fake nodes contained in a same community are merged prior to fake nodes contained in different communities.Experimental results on real datasets show that the newly proposed MLDA scheme is effective to balance the privacy and utility of the anonymized graph.
directed social network graphgraph publishingk-degree anonymitycommunity structuregraph utility
Yuanjing HAO、Long LI、Liang CHANG、Tianlong GU
展开 >
Guangxi Key Laboratory of Trusted Software,Guilin University of Electronic Technology,Guilin 541004,China
Engineering Research Center of Trustworthy AI(Ministry of Education),Jinan University,Guangzhou 510632,China
NETL
NSTL
万方数据
