基于聚类的动态社交网络隐私保护方法

doi:10.11959/j.issn.1000-436x.2015290

通信学报 ›› 2015, Vol. 36 ›› Issue (Z1): 126-130.doi: 10.11959/j.issn.1000-436x.2015290

基于聚类的动态社交网络隐私保护方法

谷勇浩¹,林九川²,郭达³

¹ 北京邮电大学计算机学院智能通信软件与多媒体北京市重点实验室，北京 100876
² 公安部第三研究所，上海 201204
³ 北京邮电大学电子工程学院，北京 100876

出版日期:2015-11-25 发布日期:2015-12-29
基金资助:
国家自然科学基金资助项目;工业和信息化部通信软科学基金资助项目;信息网络安全公安部重点实验室开放课题基金资助项目

Clustering-based dynamic privacy preserving method for social networks

Yong-hao GU¹,Jiu-chuan LIN²,Da GUO³

¹ Beijing Key Laboratory of Intelligent Telecommunications software and Multimedia,School of Computer Science,Beijing University of Posts and Telecommunications,Beijing 100876,China
² The Third Research Institute of Ministry of Public Security,Shanghai 201204,China
³ School of Electronic Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China

Online:2015-11-25 Published:2015-12-29
Supported by:
The National Natural Science Foundation of China;Communication Soft Science Foundation of Ministry of Industry and Information

摘要/Abstract

摘要：

由于社交网络图结构的动态变化特性，需要采用有效的动态隐私保护方法。针对现有动态数据发布隐私保护方法中存在的攻击者背景知识单一、对图结构动态变化适应性较低等问题，提出基于聚类的动态图发布隐私保护方法。分析表明，该方法能抵御多种背景知识攻击，同时对社交网络图结构动态变化具有较好的适应性。

关键词: 动态社交网络, 隐私保护, 聚类, 信息损失度, 隐匿率

Abstract:

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.

Key words: dynamic social networks, privacy preserving, clustering, information loss degree, anonymization rate

谷勇浩,林九川,郭达. 基于聚类的动态社交网络隐私保护方法[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.

图/表 3

参考文献 21

[1]	付艳艳, 张敏, 冯登国 , 等. 基于节点分割的社交网络属性隐私保护[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.
[2]	刘向宇, 王斌, 杨晓春 . 社会网络数据发布隐私保护技术综述[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.
[3]	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.
[4]	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.
[5]	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.
[6]	YING X , WU X , YING X . Randomizing social networks:a spectrum preserving approach[J]. SDM, 2008: 739-750.
[7]	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.
[8]	ZHELEVA E , GETOOR. L . Preserving the privacy of sensitive relationships in graph data[A]. Privacy,Security,and Trust in KDD[C]. 2008. 153-171.
[9]	ANDERSEN S K , JUDEA P . Probabilistic reasoning in intelligent systems:networks of plausible inference[J]. Artificial Intelligence, 1991,48(91): 117-124.
[10]	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.
[11]	CORMODE G , SRIVASTAVA D , Yu T , et al. Anonymizing bipartite graph data using safe groupings[J]. VLDB Journal, 2010,19(1): 115-139.
[12]	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.
[13]	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.
[14]	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.
[15]	张晓琳, 李玉峰, 王颖 . 动态社会网络隐私保护方法研究[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.
[16]	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.
[17]	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.
[18]	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
[19]	张伟, 王旭然, 王珏 , 等. 基于 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.
[20]	孙浩月 . 防止图结构攻击的社会网络隐私保护技术研究[D]. 东北大学, 2011. SUN H Y . Research on the techniques of social network privacy preserving against graph structural attacks[D]. Northeastern University, 2011.
[21]	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.

基于聚类的动态社交网络隐私保护方法

Clustering-based dynamic privacy preserving method for social networks

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 3

参考文献 21

相关文章 15

Metrics

推荐阅读 0

[1]	马玲, 樊漆亮, 许婷, 郭冠琛, 张圣林, 孙永谦, 张玉志. 基于强化学习的在线离线混部云环境下的调度框架[J]. 通信学报, 2023, 44(6): 90-102.
[2]	马鑫迪, 李清华, 姜奇, 马卓, 高胜, 田有亮, 马建峰. 面向Non-IID数据的拜占庭鲁棒联邦学习[J]. 通信学报, 2023, 44(6): 138-153.
[3]	余晟兴, 陈泽凯, 陈钟, 刘西蒙. DAGUARD：联邦学习下的分布式后门攻击防御方案[J]. 通信学报, 2023, 44(5): 110-122.
[4]	冯涛, 陈李秋, 方君丽, 石建明. 基于本地化差分隐私和属性基可搜索加密的区块链数据共享方案[J]. 通信学报, 2023, 44(5): 224-233.
[5]	夏莹杰, 朱思雨, 刘雪娇. 区块链架构下具有条件隐私的车辆编队跨信任域高效群组认证研究[J]. 通信学报, 2023, 44(4): 111-123.
[6]	胡柏吉, 张晓娟, 李元诚, 赖荣鑫. 支持多功能的V2G网络隐私保护数据聚合方案[J]. 通信学报, 2023, 44(4): 187-200.
[7]	徐明, 张保俊, 伍益明, 应晨铎, 郑宁. 面向网络攻击和隐私保护的多智能体系统分布式共识算法[J]. 通信学报, 2023, 44(3): 117-127.
[8]	董煜, 张友鹏. 基于聚类赋权的冲突证据组合方法[J]. 通信学报, 2023, 44(3): 157-163.
[9]	余晟兴, 陈钟. 基于同态加密的高效安全联邦学习聚合框架[J]. 通信学报, 2023, 44(1): 14-28.
[10]	赵静, 李俊, 龙春, 万巍, 魏金侠, 陈凯. 基于多层次特征的RoQ隐蔽攻击无监督检测方法[J]. 通信学报, 2022, 43(9): 224-239.
[11]	张学旺, 黎志鸿, 林金朝. 基于公平盲签名和分级加密的联盟链隐私保护方案[J]. 通信学报, 2022, 43(8): 131-141.
[12]	李骜, 冯聪, 牛宇童, 徐士彪, 张英涛, 孙广路. 面向视角非对齐数据的多视角聚类方法[J]. 通信学报, 2022, 43(7): 143-152.
[13]	王继锋, 王国峰. 边缘计算模式下密文搜索与共享技术研究[J]. 通信学报, 2022, 43(4): 227-238.
[14]	封化民, 史瑞, 袁峰, 李艳俊, 杨旸. 高效的强隐私保护和可转让的属性票据方案[J]. 通信学报, 2022, 43(3): 63-75.
[15]	毛伊敏, 甘德瑾, 廖列法, 陈志刚. 基于Spark框架和ASPSO的并行划分聚类算法[J]. 通信学报, 2022, 43(3): 148-163.