###

计算机系统应用英文版:2022,31(11):21-30

View/Add Comment 过刊浏览高级检索 HTML

←前一篇 | 后一篇→

码上扫一扫！

下载全文

基于节点1-邻居图相似性的社会网络匿名技术

李啸林^1,2, 章红艳^1,2, 许佳钰^1,2, 许力^1,2, 黄赞³

(1.福建师范大学计算机与网络空间安全学院, 福州 350007;2.福建师范大学福建省网络安全与密码技术重点实验室, 福州 350007;3.福建省无线通讯重点实验室, 福州 350002)

Social Network Data Anonymization Based on Node 1-neighbor Graphs Similarity

LI Xiao-Lin^1,2, ZHANG Hong-Yan^1,2, XU Jia-Yu^1,2, XU Li^1,2, HUANG Zan³

(1.School of Computer and Cyber Security, Fujian Normal University, Fuzhou 350007, China;2.Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China;3.Key Laboratory of Wireless Communication in Fujian Province, Fuzhou 350002, China)

摘要

图/表

参考文献

相似文献

本文已被：浏览 762次下载 1437次
Received:March 09, 2022 Revised:April 07, 2022

中文摘要: 利用传统的k匿名技术在社会网络中进行隐私保护时会存在聚类准则单一、图中数据信息利用不足等问题. 针对该问题, 提出了一种利用Kullback-Leibler (KL)散度衡量节点1-邻居图相似性的匿名技术(anonymization techniques for measuring the similarity of node 1-neighbor graph based on Kullback-Leibler divergence, SNKL). 根据节点1-邻居图分布的相似性对原始图节点集进行划分, 按照划分好的类进行图修改, 使修改后的图满足k匿名, 完成图的匿名发布. 实验结果表明, SNKL方法与HIGA方法相比在聚类系数上的改变量平均降低了17.3%, 同时生成的匿名图与原始图重要性节点重合度保持在95%以上. 所提方法在有效保证隐私的基础上, 可以显著的降低对原始图结构信息的改变.

中文关键词: 隐私保护社会网络概率不可区分性 k匿名 1-邻居图网络安全

Abstract:Using traditional k-anonymization techniques to achieve privacy protection in social networks is faced with problems such as single clustering criterion and under-utilization of data and information in the graph. To solve this problem, this study proposes an anonymization technique measuring the similarity of the node 1-neighbor graph based on the Kullback-Leibler divergence (SNKL). The original graph node set is divided according to the similarity of node 1-neighbor graph distribution, and the graph is modified according to the divided classes so that the modified graph satisfies k-anonymity. On this basis, the anonymous release of the graph is implemented. The experimental results show that compared with the HIGA method, the SNKL method reduces the amount of change in the clustering coefficients by 17.3% on average. Moreover, the overlap ratio between the importance nodes of the generated anonymous graph and those of the original graph is maintained at more than 95%. In addition to protecting privacy effectively, the proposed method can significantly reduce the changes brought to the structural information in the original graph.

keywords: privacy protection social network probabilistic indistinguishability k-anonymity 1-neighbor graph cyber security

文章编号： 中图分类号： 文献标志码：

基金项目:国家自然科学基金(U1905211, 61771140, 62171132); 福建省科技项目(2021L3032); 企事业合作项目(DH-1565)

Author Name	Affiliation	E-mail
LI Xiao-Lin	School of Computer and Cyber Security, Fujian Normal University, Fuzhou 350007, China Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China
ZHANG Hong-Yan	School of Computer and Cyber Security, Fujian Normal University, Fuzhou 350007, China Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China
XU Jia-Yu	School of Computer and Cyber Security, Fujian Normal University, Fuzhou 350007, China Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China
XU Li	School of Computer and Cyber Security, Fujian Normal University, Fuzhou 350007, China Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China	xuli@fjnu.edu.cn
HUANG Zan	Key Laboratory of Wireless Communication in Fujian Province, Fuzhou 350002, China

Author Name	Affiliation	E-mail
LI Xiao-Lin	School of Computer and Cyber Security, Fujian Normal University, Fuzhou 350007, China Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China
ZHANG Hong-Yan	School of Computer and Cyber Security, Fujian Normal University, Fuzhou 350007, China Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China
XU Jia-Yu	School of Computer and Cyber Security, Fujian Normal University, Fuzhou 350007, China Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China
XU Li	School of Computer and Cyber Security, Fujian Normal University, Fuzhou 350007, China Fujian Provincial Key Lab of Network Security & Cryptology, Fujian Normal University, Fuzhou 350007, China	xuli@fjnu.edu.cn
HUANG Zan	Key Laboratory of Wireless Communication in Fujian Province, Fuzhou 350002, China

引用文本：
李啸林,章红艳,许佳钰,许力,黄赞.基于节点1-邻居图相似性的社会网络匿名技术.计算机系统应用,2022,31(11):21-30
LI Xiao-Lin,ZHANG Hong-Yan,XU Jia-Yu,XU Li,HUANG Zan.Social Network Data Anonymization Based on Node 1-neighbor Graphs Similarity.COMPUTER SYSTEMS APPLICATIONS,2022,31(11):21-30