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

• 学术论文 • 上一篇    下一篇

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

兰丽辉1,2, 鞠时光1   

  1. 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-hui1,2, JU Shi-guang1   

  1. 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:

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

中图分类号: