Security analysis of weighted network anonymity based on singular value decomposition

Yong ZENG; Lingjie ZHOU; Zhongyuan JIANG; Zhihong LIU; Jianfeng MA

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

您当前的位置：

首页 >

文章列表页 >

Security analysis of weighted network anonymity based on singular value decomposition

Papers | 更新时间：2024-06-05

- Security analysis of weighted network anonymity based on singular value decomposition
- Journal on Communications Vol. 39, Issue 5, Pages: 23-33(2018)
- 作者机构：
  
  西安电子科技大学网络与信息安全学院，陕西西安 710071
- 作者简介：
- 基金信息：
  
  The National Key Research and Development Program(2016YFB0800601);The National Natural Science Foundation of China(U1405255);China 111 Project(B16037);The Central University Basic Business Expenses Special Funding for Scientific Research Projects(BDZ011402)
- DOI：10.11959/j.issn.1000-436x.2018074
  CLC： TP309
- Online First：2018-05，
  
  Published：25 May 2018
- 稿件说明：
移动端阅览
Yong ZENG, Lingjie ZHOU, Zhongyuan JIANG, et al. Security analysis of weighted network anonymity based on singular value decomposition[J]. Journal on Communications, 2018, 39(5): 23-33.
DOI：

Yong ZENG, Lingjie ZHOU, Zhongyuan JIANG, et al. Security analysis of weighted network anonymity based on singular value decomposition[J]. Journal on Communications, 2018, 39(5): 23-33. DOI： 10.11959/j.issn.1000-436x.2018074.

摘要

分析基于奇异值分解（SVD）的匿名方法在加权社交网络隐私保护中的安全性，给出在含整数权重网络中的重构方法和在含任意权重网络中的非精确重构方法，定义

-容忍性来衡量其安全性，指出目前谱分析理论得到的ε（可重构系数）上界过于保守因而缺乏指导性。通过实验来测试随机网络、Barabasi-Albert网络、小世界网络以及实际网络的可重构系数，同时测试了基于 SVD 的双重扰动策略的可重构系数。实验结果表明，加权社交网络对谱的丢失具有不同的容忍性，其容忍性与网络参数之间存在密切的关系。

Abstract

The security of anonymous method based on singular value decomposition (SVD) in the privacy preserving of weighted social network was analyzed.The reconstruction method in network with integer weights and the inexact reconstruction method in network with arbitrary weighted were proposed.The

-tolerance was definited to measure its safety.It was also pointed out that the upper bound of ε (the reconfigurable coefficient) obtained in current spectral theories was so conservative that lacks of guidance.The reconfigurable coefficients of random networks

Barabasi-Albert networks

small world networks and real networks were calculated by experiment.Moreover

the reconfigurable coefficients of double perturbation strategies based on SVD were also tested.Experimental results show that weighted social networks have different tolerances on spectrum loss

and there is a close relationship between its tolerance and network parameters.

关键词

Keywords

references

冯登国 , 张敏 , 李昊 . 大数据安全与隐私保护 [J ] . 计算机学报 , 2014 , 37 ( 1 ): 246 - 258 .

FENG D G , ZHANG M , LI H , et al . Big data security and privacy protection [J ] . Chinese Journal of Computers , 2014 , 37 ( 1 ): 246 - 258 .

WONG R C W , LI J , FU A W C , et al . (α,k)-anonymity:an enhanced k-anonymity model for privacy preserving data publishing [C ] // The 12th ACM SIGKDD international conference on Knowledge discovery and data mining . 2006 : 754 - 759 .

CORMODE G , SRIVASTAVA D , YU T , et al . Anonymizing bipartite graph data using safe groupings [J ] . The VLDB Journal—The International Journal on Very Large Data Bases , 2010 , 19 ( 1 ): 115 - 139 .

CHENG J , FU A W , LIU J . K-isomorphism:privacy preserving network publication against structural attacks [C ] // The 2010 ACM SIGMOD International Conference on Management of Data . 2010 : 459 - 470 .

ABAWAJY J H , NINGGAL M I H , HERAWAN T . Privacy preserving social network data publication [J ] . IEEE Communications Surveys ＆Tutorials , 2016 , 18 ( 3 ): 1974 - 1997 .

LIU L , WANG J , LIU J , et al . Privacy preserving in social networks against sensitive edge disclosure [R ] . Technical Report Technical Report CMIDA-HiPSCCS 006-08 , 2008 .

DAS S , EĞECIOĞLU Ö , EL ABBADI A . Anonymizing weighted social network graphs [C ] // 2010 IEEE 26th International Conference on Data Engineering (ICDE) . 2010 : 904 - 907 .

LI Y , LI Y , YAN Q , et al . Privacy leakage analysis in online social networks [J ] . Computers ＆ Security , 2015 , 49 : 239 - 254 .

苏洁 , 刘帅 , 罗智勇 , 等 . 基于信息损失量估计的匿名图构造方法 [J ] . 通信学报 , 2016 , 37 ( 6 ): 56 - 64 .

SU J , LIU S , LUO Z Y , et al . Method of constructing an anonymous graph based on information loss estimation [J ] . Journal on Communi-cations , 2016 , 37 ( 6 ): 56 - 64 .

LIU D , WANG H , VAN M P . Spectral perturbation and reconstructability of complex networks [J ] . Physical Review E , 2010 , 81 ( 1 ):016101.

XU S , ZHANG J , HAN D , et al . Singular value decomposition based data distortion strategy for privacy preserving [J ] . Knowledge and Information Systems , 2006 , 10 ( 3 ): 383 - 397 .

WU L , YING X , WU X . Reconstruction from randomized graph via low rank approximation [C ] // The 2010 SIAM International Conference on Data Mining,Society for Industrial and Applied Mathematics . 2010 : 60 - 71 .

PECH R , HAO D , PAN L , et al . Link prediction via matrix completion [J ] . EPL (Europhysics Letters) , 2017 , 117 ( 3 ):38002.

XU X , LIU B , WU J , et al . Link prediction in complex networks via matrix perturbation and decomposition [J ] . Scientific Reports , 2017 , 7 ( 1 ):14724.

SARKAR S , . Spectral (re) construction of urban street networks:generative design using global information from structure [M ] // Design Computing and Cognition'14 . Springer International Publishing , 2015 : 41 - 55 .

张贤达 . 矩阵分析与应用(第2版) [M ] . 北京 : 清华大学出版社 , 2013 .

ZHANG X D . Matrix analysis and applications(second edi-tion) [M ] . Beijing : Tsinghua University PressPress , 2013 .

戴华 . 矩阵论 [M ] . 北京 : 科学出版社 , 2001 .

DAI H . Matrix theo-ry [M ] . Beijing : Science PressPress , 2001 .

HORN R A , JOHNSON C R . 矩阵分析 [M ] . 天津 : 天津大学出版社 , 1989 .

HORN R A,JOHNSON , C R . Matrix analysis [M ] . Tianjin : Tianjin University PressPress , 2001 .

ZHANG X D . Matrix analysis and applications [M ] . Cambridge University Press , 2017 .

ERDŐS P RÉNYI A . On the evolution of random graphs [J ] . Transactions of the American Mathematical Society , 1984 , 286 ( 1 ): 257 - 274 .

BARABÁSI A L , ALBERT R . Emergence of scaling in random networks [J ] . Science , 1999 , 286 ( 5439 ): 509 - 512 .

WATTS D J , STROGATZ S H . Collective dynamics of “small-world”networks [J ] . Nature , 1998 , 393 ( 6684 ): 440 - 442 .

ABUELHAIJA S , PEROZZI B , ALRFOU R . Learning edge representations via low-rank asymmetric projections [C ] // The 2017 ACM Conference on Information and Knowledge Management . 2017 : 1787 - 1796 .

GLEISER P M , DANON L . Community structure in jazz [J ] . Advances in Complex Systems , 2003 , 6 ( 4 ): 565 - 573 .

Views

2869

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Efficient privacy-preserving decision tree classification protocol

Privacy risk adaptive access control model via evolutionary game

Dynamic game and reliable recommendation based transferring reputation mechanism for mobile cloud computing

Network function outsourcing system based on prefix-preserving encryption

Efficient and scalable architecture for searchable symmetric encryption

Related Author

Haojin ZHU

Qingqi PEI

Jiayi PENG

Lichuan MA

Shuwen XIANG

Youliang TIAN

Changgen PENG

Hongfa DING

Related Institution

The Department of Computer Science and Engineering, Shanghai Jiao Tong University

Shaanxi Key Laboratory of Blockchain and Secure Computing

The State Key Laboratory of Integrated Services Networks, Xidian University

College of Computer Science and Technology, Guizhou University

College of Information, Guizhou University of Finance and Economics

AI问答

⁰