Computer Science ›› 2019, Vol. 46 ›› Issue (10): 154-160.doi: 10.11896/jsjkx.180901749

• Information Security • Previous Articles     Next Articles

Cluster-based Social Network Privacy Protection Method

ZHOU Yi-hua, ZHANG Bing, YANG Yu-guang, SHI Wei-min   

  1. (Faculty of Information Technology,Beijing University of Technology,Beijing 100124,China)
    (Beijing Key Laboratory of Trusted Computing,Beijing 100124,China)
  • Received:2018-09-16 Revised:2019-04-21 Online:2019-10-15 Published:2019-10-21

Abstract: With the rapid development of social networks,social networks have accumulated a large amount of data,which reflect the social laws to some extent.Aiming at mining effective knowledge under the premise of ensuring privacy,this paper proposed a clustering-based social network privacy protection method.The method has the characteristics of adaptive privacy protection strength,high security and effectiveness of anonymity model.Clustering is conducted based on user information and social relationships.It clusters all nodes in the social network into a super point containing at least k nodes according to the distance between nodes,and then the super points are anonymized.Anonymous super points can effectively prevent various types of privacy attacks taking node attribute privacy and sub-graph structure as background knowledge,so that attackers cannot identify users with a probability greater than 1/k.According to the characteristics of clustering algorithm and social network,the initial node selection algorithm and node spacing calculation method in clustering process are optimized,and by combining the adaptive thinking,the selection method of privacy protection strength is also optimized,which effectively reduces information loss and improves data validity.Experiments were carried out on Matlab platform with different data sets.The results show that the proposed method issuperior to other related methods in terms of information loss and running time,which further proves its effectiveness and security.

Key words: Social network, Privacy protection, K-anonymity, Clustering, Information security

CLC Number: 

  • TP391
[1]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.
[2]LIU K,TERZI E.Towards identity anonymization on graphs [C]//ACM SIGMOD International Conference on Management of Data.ACM,2008:93-106.
[3]LIU K,DAS K,GRANDISON T,et al.Privacy-Preserving Data Analysis on Graphs and Social Networks[OL].https://www.researchgate.net/publication/290110049_Privacy-Preserving_Data_Analysis_on_Graphs_and_Social_Networks.
[4]CEN T T,HAN J M,WANG J Y,et al.Survey of K-anonymity research on privacy preservation[J].Computer Engineering & Applications,2008,44(4):130-134.(in Chinese)
岑婷婷,韩建民,王基一,等.隐私保护中K-匿名模型的综述[J].计算机工程与应用,2008,44(4):130-134.
[5]WANG Z B,SHEN M Y,ZHAO J.Privay protection technology discussion of social network based on node reconstruction.Computer Engineering and Applications,2017,53(11):131-136.(in Chinese)
王正彬,沈明玉,赵皎.基于节点重构的社交网络的隐私保护技术探讨.计算机工程与应用,2017,53(11):131-136.
[6]XIE Y,ZHENG M.A Differentiated Anonymity Algorithm for Social Network Privacy Preservation[J].Algorithms,2016,9(4):85.
[7]ZHELEVA E,GETOOR L.Preserving the Privacy of Sensitive Relationships in Graph Data[C]//ACM SIGKDD International Conference on Privacy,Security,and Trust in Kdd.Springer-Verlag,2008:153-171.
[8]ZOU L,CHEN L,ÖZSU M T.k-automorphism:a general framework for privacy preserving network publication[M].VLDB Endowment,2009.
[9]GU Y H,LIN J C,GUO D.Clusterin-based bynamic privacy preserving method for social networks.Journal on Communications,2015,36(S1),126-130.(in Chinese)
谷勇浩,林九川,郭达.基于聚类的动态社交网络隐私保护方法.通信学报,2015,36(S1):126-130.
[10]CAMPAN A,TRUTA T M.Data and Structural k-Anonymity in Social Networks[M]//Privacy,Security,and Trust in KDD.Springer Berlin Heidelberg,2008:33-54.
[11]SKARKALA M E,MARAGOUDAKIS M,GRITZALIS S,et al.Privacy Preservation by k-Anonymization of Weighted Social Networks[C]//IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.IEEE,2012:423-428.
[12]LAN L H ,JU S G,JIN H.Social Networks Data Publication Based on k-anonymity[J].Computer Science,2011,38(11):156-160.(in Chinese)
兰丽辉,鞠时光,金华.社会网络数据的k-匿名发布[J].计算机科学,2011,38(11):156-160.
[13]JIANG H W,ZHAN Q H,LIU W J,et al.Clustering-Anonymity Approach for Privacy Preservation of Graph Data-Publishing[J].Journal of Software,2017,28(9):2323-2333.(in Chinese)
姜火文,占清华,刘文娟,等.图数据发布隐私保护的聚类匿名方法[J].软件学报,2017,28(9):2323-2333.
[14]RONG H,MA T H,TANG M L,et al.A novel subgraph K+-isomorphism method in social network based on graph similarity detection [J].Soft Computing,2018,22(8):2583-2601.
[15]SAMANTHULA B K,LEI C,WEI J,et al.Privacy-Preserving and Efficient Friend Recommendation in Online Social Networks[J].Transactions on Data Privacy,2015,8(2):141-171.
[16]LIU P,BAI Y,WANG L,et al.Partial k-Anonymity for Privacy-Preserving Social Network Data Publishing[J].International Journal of Software Engineering & Knowledge Engineering,2016,27(1):71-90.
[17]YU F H,CHEN M J,YU B L,et al.Privacy preservation based on clustering perturbation algorithm for social network[J].Multimedia Tools & Applications,2018,77(9):1-18.
[18]QIAN J W,LI X Y,ZHANG C H,et al.Social Network De-Anonymization and Privacy Inference with Knowledge GraphMo-del[J].IEEE Transactions on Dependable and Secure Computing,2017,PP(99):1-1.
[1] YU Xue-yong, CHEN Tao. Privacy Protection Offloading Algorithm Based on Virtual Mapping in Edge Computing Scene [J]. Computer Science, 2021, 48(1): 65-71.
[2] LIANG Wei, DUAN Xiao-dong, XU Jian-feng. Three-way Filtering Algorithm of Basic Clustering Based on Differential Measurement [J]. Computer Science, 2021, 48(1): 136-144.
[3] ZHANG Yu, LU Yi-hong, HUANG De-cai. Weighted Hesitant Fuzzy Clustering Based on Density Peaks [J]. Computer Science, 2021, 48(1): 145-151.
[4] MA Li-bo, QIN Xiao-lin. Topic-Location-Category Aware Point-of-interest Recommendation [J]. Computer Science, 2020, 47(9): 81-87.
[5] LI Yan, SHEN De-rong, NIE Tie-zheng, KOU Yue. Multi-keyword Semantic Search Scheme for Encrypted Cloud Data [J]. Computer Science, 2020, 47(9): 318-323.
[6] YANG Fan, WANG Jun-bin, BAI Liang. Extended Algorithm of Pairwise Constraints Based on Security [J]. Computer Science, 2020, 47(9): 324-329.
[7] XU Shou-kun, NI Chu-han, JI Chen-chen, LI Ning. Image Caption of Safety Helmets Wearing in Construction Scene Based on YOLOv3 [J]. Computer Science, 2020, 47(8): 233-240.
[8] CHEN Qing-chao, WANG Tao, FENG Wen-bo, YIN Shi-zhuang, LIU Li-jun. Unknown Binary Protocol Format Inference Method Based on Longest Continuous Interval [J]. Computer Science, 2020, 47(8): 313-318.
[9] CAO Su-e, YANG Ze-min. Prediction of Wireless Network Traffic Based on Clustering Analysis and Optimized Support Vector Machine [J]. Computer Science, 2020, 47(8): 319-322.
[10] GAO Fang-yuan, WANG Xiu-mei. Subspace Clustering Method Based on Block Diagonal Representation and Neighbor Constraint [J]. Computer Science, 2020, 47(7): 66-70.
[11] LI Xiang-li, JIA Meng-xue. Nonnegative Matrix Factorization Algorithm with Hypergraph Based on Per-treatments [J]. Computer Science, 2020, 47(7): 71-77.
[12] ZHANG Heng, MA Ming-dong, WANG De-yu. Text-Video Feature Learning Based on Clustering Network [J]. Computer Science, 2020, 47(7): 125-129.
[13] GUO Rui, LU Tian-liang, DU Yan-hui, ZHOU Yang, PAN Xiao-qin, LIU Xiao-chen. WSN Source-location Privacy Protection Based on Improved Ant Colony Algorithm [J]. Computer Science, 2020, 47(7): 307-313.
[14] CHEN Jin-yin, ZHANG Dun-Jie, LIN Xiang, XU Xiao-dong and ZHU Zi-ling. False Message Propagation Suppression Based on Influence Maximization [J]. Computer Science, 2020, 47(6A): 17-23.
[15] YANG Zhuo-xuan, MA Yuan-pei and YAN Guan. Polynomial Time Community Detection Algorithm Based on Coupling Strength [J]. Computer Science, 2020, 47(6A): 102-107.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .