基于向量相似的权重社会网络隐私保护

doi:10.3969/j.issn.0372-2112.2015.08.015

电子学报 ›› 2015, Vol. 43 ›› Issue (8): 1568-1574.DOI: 10.3969/j.issn.0372-2112.2015.08.015

基于向量相似的权重社会网络隐私保护

兰丽辉^1,2, 鞠时光¹

1. 江苏大学计算机科学与通信工程学院, 江苏镇江 212013;
2. 沈阳大学信息工程学院, 辽宁沈阳 110000

收稿日期:2014-08-07 修回日期:2015-01-08 出版日期:2015-08-25
- 通讯作者:
- 兰丽辉
- 作者简介:
- 鞠时光 男,1955年出生,江苏南通人,博士,CCF高级会员,江苏大学计算机科学与通信工程学院教授、博士生导师,主要研究方向为空间数据库、信息安全理论与技术. E-mail:jushig@ ujs.edu.cn
- 基金资助:
- 国家自然科学基金 (No.61003288,61111130184); 国家教育部博士点基金 (No.20093227110005); 江苏省普通高校研究生科研创新计划项目 (No.CX10B_006X)

Privacy Preserving Based on Vector Similarity for Weighted Social Networks

LAN Li-hui^1,2, JU Shi-guang¹

1. School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang, Jiangsu 212013, China;
2. School of Information Engineering, Shenyang University, Shenyang, Liaoning 110000, China

Received:2014-08-07 Revised:2015-01-08 Online:2015-08-25 Published:2015-08-25
- Supported by:
- National Natural Science Foundation of China (No.61003288, 61111130184); Ph.D. Programs Foundation of Ministry of Education of China (No.20093227110005); Graduate Research Innovation Program of univerities in Jiangsu Province (No.CX10B_006X)

摘要/Abstract

摘要：

针对权重社会网络发布,提出采用基于向量相似的随机扰动方法实现多个发布场景下网络结构和边权重的隐私保护.该方法以边空间理论为基础,采用基于节点聚类的分割方法构建权重社会网络的向量集模型;以加权欧氏距离作为向量相似的度量标准,根据选定阈值构建发布候选集;从候选集随机选取向量实现权重社会网络的发布;可抵御多种节点识别攻击,迫使攻击者在一个向量发生概率相同的庞大结果集中进行重识别,增加了识别的不确定性.实验结果表明,该方法在确保社会个体隐私安全同时可保护社会网络分析所需的某些结构特征,提高发布数据效用.

关键词: 社会网络, 边权重, 隐私保护, 向量集模型, 加权欧氏距离

Abstract:

Aiming at the publication of weighted social networks, a random perturbation method based on vector similarity is proposed.It can protect network structures and edge weights in multiple release scenarios.It constructs vector set models by segmentation based on vertex cluster using edge space theory.It adopts weighted Euclidean distance as similarity metrics to construct the released candidate sets according to the threshold.It randomly selects vectors from candidate sets to construct the published weighted social networks.The proposed method can resist multiple vertex recognition attacks, force attackers to re-identify in a large result set that the existential probabilities of the vectors are same, and increase the uncertainty of recognition.The experimental results demonstrate that it can preserve individuals' privacy security, meanwhile it can protect some structure characteristics for networks analysis and improve data utility.

Key words: social networks, edge weight, privacy preserving, vector set model, weighted Euclidean distance

中图分类号:

TP309.2

兰丽辉, 鞠时光. 基于向量相似的权重社会网络隐私保护[J]. 电子学报, 2015, 43(8): 1568-1574.

LAN Li-hui, JU Shi-guang . Privacy Preserving Based on Vector Similarity for Weighted Social Networks[J]. Acta Electronica Sinica, 2015, 43(8): 1568-1574.

参考文献

[1] Zhou B,Pei J.Preserving privacy in social networks against neighborhood attacks[A].2008 IEEE 24^th International Conference on Data Engineering[C].Cancun,Mexico:IEEE Computer Society,2008.506-515.
[2] Liu K,Terzi E.Towards identity anonymization on graphs[A].2008 ACM SIGMOD International Conference on Management of Data[C].Vancouver,Canada:Association for Computing Machinery,2008.93-106.
[3] Zou L,Chen L,Özsu M T.K-automorphism:A general framework for privacy preserving network publication[J].Proceedings of the VLDB Endowment,2009,2(1):946-957.
[4] Hay M,Mikiau G,Jensen D,Weis P,et al.Anonymizing social networks[R].University of Massachusetts Amherst,2007.
[5] Ying X W,Wu X T.Randomizing social networks:A spectrum preserving approach[A].2008 8^th SIAM International Conference on Data Mining[C].Atlanta,United States:Society for Industrial and Applied Mathematics Publications,2008.739-750.
[6] Liu L,Wang J,Liu J et al.Privacy preserving in social networks against sensitive edge disclosure[R].Department of Computer Science,University of Kentucky,2008.
[7] Das S,Egecioglu Ö,Abbadi A E.Anónimos:An LP-based approach for anonymizing edge-weighted social network graphs[J].IEEE Transactions on Knowledge and Data Engineering,2012,4(4):590-603.
[8] Li Y,Shen H.Anonymizinggraphs against weight-based attacks[A].2010 10^th IEEE International Conference on Data Mining Workshops[C].Sydney,Australia:IEEE,2010.491-498.
[9] Skarkala M E,Maragoudakis M,Gritzalis S et al.Privacypreservation by k-anonymization of weighted social networks[A].2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining[C].Istanbul,Turkey:IEEE Computer Society,2012.423-428.
[10] 王树禾.图论(第二版)[M].北京:科学出版社,2009:177-180.
[11] 吕锋,杜妮,文成林.一种模糊-证据kNN分类方法[J].电子学报,2012,40(12):2390-2395. Lü Feng,Du Ni,Wen Cheng-lin.A fuzzy-evidential k nearest neighbor classification algorithm[J].Acta Electronica Sinica,2012,40(12):2390-2395.( in Chinese)
[12] Newman M E J,Girvan M.Finding and evaluating community structure in networks[J].Physical Review E,2004,69(2):1-15.
[13] Lü L,Zhou T.Link prediction in complex networks:A survey[J].Physica A:Statistical Mechanics and its Applications,2011,390(6):1150-1170.
[14] Girvan M,Newman M E J.Community structure in social and biological networks[J].Proceedings of the National Academy of Sciences,2002,99(12):7821-7826.
[15] Nexus.The network repository [DB/OL].http://nexus.igraph.org/.

基于向量相似的权重社会网络隐私保护

Privacy Preserving Based on Vector Similarity for Weighted Social Networks

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	郭庆, 田有亮, 万良. 基于代理重加密的区块链数据受控共享方案[J]. 电子学报, 2023, 51(2): 477-488.
[2]	张少波, 原刘杰, 毛新军, 朱更明. 基于本地差分隐私的K-modes聚类数据隐私保护方法[J]. 电子学报, 2022, 50(9): 2181-2188.
[3]	丁毅, 沈薇, 李海生, 钟琼慧, 田明宇, 李洁. 面向CNN的区块链可信隐私服务计算模型[J]. 电子学报, 2022, 50(6): 1399-1409.
[4]	袁水莲, 皮德常, 胥萌. 基于差分隐私的轨迹隐私保护方法[J]. 电子学报, 2021, 49(7): 1266-1273.
[5]	朱健, 胡凯, 张伯钧. 智能合约的形式化验证方法研究综述[J]. 电子学报, 2021, 49(4): 792-804.
[6]	郑孝遥, 罗永龙, 汪祥舜, 孙丽萍, 陈付龙, 胡桂银, 汪小寒. 基于位置服务的分布式差分隐私推荐方法研究[J]. 电子学报, 2021, 49(1): 99-110.
[7]	高玉君, 梁刚, 蒋方婷, 许春, 杨进, 陈俊任, 王浩. 社会网络谣言检测综述[J]. 电子学报, 2020, 48(7): 1421-1435.
[8]	杨洁, 朱咸军, 周献中, 柳毅. 基于混杂社会网络的个性化Web服务推荐方法[J]. 电子学报, 2020, 48(2): 341-349.
[9]	陈传明, 林文诗, 俞庆英, 罗永龙. 一种基于单点收益的轨迹隐私保护方法[J]. 电子学报, 2020, 48(1): 143-152.
[10]	马慧芳, 刘文, 李志欣, 蔺想红. 融合耦合距离区分度和强类别特征的短文本相似度计算方法[J]. 电子学报, 2019, 47(6): 1331-1336.
[11]	宋海娜, 罗涛, 韩新宇, 李剑峰. 面向多敏感值的个性化随机响应机制设计与分析[J]. 电子学报, 2019, 47(6): 1236-1243.
[12]	杨高明, 朱海明, 方贤进, 苏树智. 局部差分隐私约束的关联属性不变后随机响应扰动[J]. 电子学报, 2019, 47(5): 1079-1085.
[13]	汪林玉, 谷科, 余飞, 尹波, 廖年冬. 基于个人意愿的社会网络团体结构与信息检测方案[J]. 电子学报, 2019, 47(4): 886-895.
[14]	朱恩强, 吴艳蕾, 许宇光, 牛云云. 基于树核度的社交网络影响最大化问题[J]. 电子学报, 2019, 47(1): 161-168.
[15]	罗恩韬, 陈淑红, 王文博, 张少波, PINIAL Khan-butt. 移动社交网络多密钥混淆的交友隐私保护方案研究[J]. 电子学报, 2018, 46(9): 2123-2130.