浏览全部资源
扫码关注微信
1. 北京邮电大学 计算机学院 智能通信软件与多媒体北京市重点实验室,北京 100876
2. 公安部第三研究所,上海 201204
3. 北京邮电大学 电子工程学院,北京 100876
[ "谷勇浩(1980-),男,山西太原人,博士,北京邮电大学讲师,主要研究方向为网络安全、隐私保护等。" ]
[ "林九川(1980-),男,江苏盐城人,硕士,公安部第三研究所助理研究员,主要研究方向为信息安全。" ]
[ "郭达(1976-),男,江西南昌人,北京邮电大学电子工程学院博士后,主要研究方向为物联网、移动互联网等。" ]
网络出版日期:2015-11,
纸质出版日期:2015-11-25
移动端阅览
谷勇浩, 林九川, 郭达. 基于聚类的动态社交网络隐私保护方法[J]. 通信学报, 2015,36(Z1):126-130.
Yong-hao GU, Jiu-chuan LIN, Da GUO. Clustering-based dynamic privacy preserving method for social networks[J]. Journal on communications, 2015, 36(Z1): 126-130.
谷勇浩, 林九川, 郭达. 基于聚类的动态社交网络隐私保护方法[J]. 通信学报, 2015,36(Z1):126-130. DOI: 10.11959/j.issn.1000-436x.2015290.
Yong-hao GU, Jiu-chuan LIN, Da GUO. Clustering-based dynamic privacy preserving method for social networks[J]. Journal on communications, 2015, 36(Z1): 126-130. DOI: 10.11959/j.issn.1000-436x.2015290.
由于社交网络图结构的动态变化特性,需要采用有效的动态隐私保护方法。针对现有动态数据发布隐私保护方法中存在的攻击者背景知识单一、对图结构动态变化适应性较低等问题,提出基于聚类的动态图发布隐私保护方法。分析表明,该方法能抵御多种背景知识攻击,同时对社交网络图结构动态变化具有较好的适应性。
Due to the dynamic characteristics of the social network graph structure
an effective dynamic privacy preserving method was needed.To solve the problems of the existing dynamic privacy preservation methods
such as attacker’s too little background knowledge and the low adaptability to the dynamic characteristics of graph structure
a clustering-based dynamic privacy preservation method was provided.The analysis shows that the proposed method can resist many kinds of background knowledge attacks and has good adaptability to the dynamic characteristics of the social network graph structure.
付艳艳 , 张敏 , 冯登国 , 等 . 基于节点分割的社交网络属性隐私保护 [J ] . 软件学报 , 2014 , 25 ( 4 ): 768 - 780 .
FU Y Y , ZHANG M , FENG D G,et al . Attribute privacy preservation in social networks based on node anatomy [J ] . Journal of Software , 2014 , 25 ( 4 ): 768 - 780 .
刘向宇 , 王斌 , 杨晓春 . 社会网络数据发布隐私保护技术综述 [J ] . 软件学报 , 2014 , 25 ( 3 ): 576 - 590 .
LIU X Y , WANG B , YANG X C . Survey on privacy preserving techniques for publishing social network data [J ] . Journal of Software , 2014 , 25 ( 3 ): 576 - 590 .
LIU X , YANG X . Protecting sensitive relationships against inference attacks in social networks [A ] . Proc of the 17th Int’l Conf on Database Systems for Advanced Applications [C ] . 2012 . 335 - 350 .
GAO J , XU J Y , JIN R . Neighborhood-privacy protected shortest distance computing in cloud [A ] . Proc of the 2011 ACM SIGMOD Int’l Conf on Management of Data [C ] . 2011 . 409 - 420 .
BHAGAT S , CORMODE G , SRIVASTAVA D . Privacy in dynamic social networks [A ] . Proceedings of the 19th International Conference on World Wide Web [C ] . ACM , 2010 . 1059 - 1060 .
YING X , WU X , YING X . Randomizing social networks:a spectrum preserving approach [J ] . SDM , 2008 : 739 - 750 .
THOMPSON B , YAO D . The union-split algorithm and cluster-based anonymization of social networks [A ] . Proceedings of the 4th International Symposium on Information,Computer,and Communications Security [C ] . 2009 . 218 - 227 .
ZHELEVA E , GETOOR. L . Preserving the privacy of sensitive relationships in graph data [A ] . Privacy,Security,and Trust in KDD [C ] . 2008 . 153 - 171 .
ANDERSEN S K , JUDEA P . Probabilistic reasoning in intelligent systems:networks of plausible inference [J ] . Artificial Intelligence , 1991 , 48 ( 91 ): 117 - 124 .
CAMPAN A , TRUTA T M . A clustering approach for data and structural anonymity in social networks [J ] . Privacy,Security,and Trust in KDD Workshop (PinKDD) , 2008 . 33 - 54 .
CORMODE G , SRIVASTAVA D , Yu T , et al . Anonymizing bipartite graph data using safe groupings [J ] . VLDB Journal , 2010 , 19 ( 1 ): 115 - 139 .
VISWANATH B , MISLOVE A , CHA M , et al . On the evolution of user interaction in facebook [A ] . Proceedings of the 2nd ACM Workshop on Online Social Networks [C ] . 2009 . 37 - 42 .
CHENG J , FU AWC , LIU J . K-isomorphism:privacy preserving network publication against structural attacks [A ] . Proc of the 2010 ACM SIGMOD Int’l Conf on Management of Data [C ] . 2010 . 459 - 470 .
ZOU L , CHEN L , OZSU MT . K-automorphism:a general framework for privacy preserving network publication [A ] . Proc of the 35th International Conference on Very Large Databases [C ] . 2009 . 946 - 957 .
张晓琳 , 李玉峰 , 王颖 . 动态社会网络隐私保护方法研究 [J ] . 计算机应用研究 , 2012 , 29 ( 4 ): 1434 - 1437 .
ZHANG X L , LI Y F , WANG Y . Research on privacy preserving method for dynamic social network [J ] . Application Research of Computers , 2012 , 29 ( 4 ): 1434 - 1437 .
KARWA V , SOFYA R , SMITH A , et al . Private analysis of graph structure [A ] . Proc of the 37th International Conference on Very Large Databases [C ] . 2011 . 1147 - 1157 .
CHEN S , ZHOU S . Recursive mechanism:towards node differential privacy and unrestricted joins [A ] . Proc of the International Conference on Management of Data [C ] . 2013 . 653 - 664 .
CHEN R , FANG B C M , PHILIP S Y , et al . Correlated network data publication via differential privacy [J ] . The VLDB Journal , 2014 , 23 ( 4 ): 653 - 676
张伟 , 王旭然 , 王珏 , 等 . 基于 k-邻域同构的动态社会网络隐私保护方法 [J ] . 南京邮电大学学报(自然科学版) , 2014 , 34 ( 5 ): 9 - 16 .
ZHANG W , WANG X R , WANG J , et al . Privacy preservation in dynamic social networks based on k-neighborhood isomorphism [J ] . Journal of Nanjing University of Posts and Telecommunications(Natural Science) , 2014 , 34 ( 5 ): 9 - 16 .
孙浩月 . 防止图结构攻击的社会网络隐私保护技术研究 [D ] . 东北大学 , 2011 .
SUN H Y . Research on the techniques of social network privacy preserving against graph structural attacks [D ] . Northeastern University , 2011 .
AGGRAWAL G , FEDER T , KENTHAPADI K , et al . Achieving Anonymity via Clustering [A ] . Proceedings of the 25th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems [C ] . 2006 , 6 ( 3 ): 153 - 162 .
0
浏览量
1820
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构