Differential privacy protection scheme based on edge betweenness model
Papers|更新时间:2024-06-05
|
Differential privacy protection scheme based on edge betweenness model
Journal on CommunicationsVol. 40, Issue 5, Pages: 88-97(2019)
作者机构:
1. 南京邮电大学计算机学院,江苏 南京 210023
2. 江苏省无线传感网高技术研究重点实验室,江苏 南京 210023
作者简介:
基金信息:
The National Natural Science Foundation of China(61672297);The Key Research and Development Program of Jiangsu Province (Social Development Program)(BE2017742);The Sixth Talent Peaks Project of Jiangsu Province in China(DZXX-017)
Haiping HUANG, Kai WANG, Xiong TANG, et al. Differential privacy protection scheme based on edge betweenness model[J]. Journal on Communications, 2019, 40(5): 88-97.
DOI:
Haiping HUANG, Kai WANG, Xiong TANG, et al. Differential privacy protection scheme based on edge betweenness model[J]. Journal on Communications, 2019, 40(5): 88-97. DOI: 10.11959/j.issn.1000-436x.2019095.
Differential privacy protection scheme based on edge betweenness model
With the continuous development of social network application
user’s personal social data is so sensitive that the problem of privacy protection needs to be solved urgently.In order to reduce the network data sensitivity
a differential privacy protection scheme BCPA based on edge betweenness model was proposed.The 2K sequence corresponding to the graph structure based on the dK model was captured
and 2K sequences based on the edge betweenness centrality were reordered.According to the result of reordering
the 2K sequence was grouped into several sub-sequences
and each sub-sequence was respectively added with noise by a dK perturbation algorithm.Finally
a social network graph satisfying differential privacy was generated according to the new 2K sequences after integration.Based on the real datasets
the scheme was compared with the classical schemes through simulation experiments.The results demonstrate that it improves the accuracy and usability of data while ensuring desired privacy protection level.
关键词
Keywords
references
WANG Q , ZHANG Y , REN K , et al . Real-time and spatio-temporal crowd-sourced social network data publishing with differential privacy [J ] . IEEE Transactions on Dependable and Secure Computing , 2018 , 15 ( 4 ): 591 - 606 .
DWORK C , . Differemtial privacy [C ] // Proceedings of the 33rd International Colloquium on Automata,Language and Programming(ICALP) . 2006 : 1 - 12 .
CASAS-ROMA J , HERRERA-JOANCOMARTI J , TORRA V . k-Degree anonymity and edge selection:improving data utility in large networks [J ] . Knowledge & Information Systems , 2016 , 50 ( 2 ): 1 - 28 .
HAY M , LI C , MIKLAU G , et al . Accurate estimation of the degree distribution of private networks [C ] // Ninth IEEE International Conference on Data Mining . 2009 : 169 - 178 .
MIR D J , WRIGHT R N . A differentially private graph estimator [C ] // IEEE International Conference on Data Mining Workshops . IEEE , 2009 : 122 - 129 .
LESKOVEC J , FALOUTSOS C . Scalable modeling of real graphs using Kronecker multiplication [C ] // Machine Learning,Proceedings of the Twenty-Fourth International Conference . 2007 : 497 - 504 .
DAY W Y , LI N , MIN L . Publishing graph degree distribution with node differential privacy [C ] // ACM International Conference on Management of Data(SIGMOD) . 2016 : 123 - 138 .
SALA A , ZHAO X , Wilson C , et al . Sharing graphs using differentially private graph models [C ] // The 11th ACM SIGCOMM Internet Measurement Conference . 2011 : 81 - 98 .
WANG Y , WU X . Preserving differential privacy in degree-correlation based graph generation [J ] . Transactions on Data Privacy , 2013 , 6 ( 2 ): 127 - 145 .
LAN L H , JU S G . Privacy preserving based on differential privacy for weighted social networks [J ] . Journal on Communications , 2015 , 36 ( 9 ): 145 - 159 .
FU Y , CHEN Z , KORU G , et al . A privacy protection technique for publishing data mining models and research data [J ] . ACM Transactions on Management Information Systems , 2010 , 1 ( 1 ): 1 - 20 .
XIONG W J , XU Z Q , WANG H . Privacy level evaluation of differential privacy for time series based on filtering theory [J ] . Journal on Communications , 2017 , 38 ( 5 ): 172 - 181 .
DWORK C , MCSHERRY F , NISSIM K , et al . Calibrating noise to sensitivity in private data analysis [C ] // The Third Theory of Cryptography Conference , 2006 : 265 - 284 .
MCSHERRY F , . Privacy integrated queries:an extensible platform for privacy-preserving data analysis [C ] // The 2009 ACM SIGMOD International Conference on Management of Data . 2009 : 19 - 30 .
JAMOUR F , SKIADOPOULOS S , KALNIS P . Parallel algorithm for incremental betweenness centrality on large graphs [J ] . IEEE Transactions on Parallel and Distributed Systems , 2018 , 29 ( 3 ): 659 - 672 .
MUHONGYA K , MAHARAJ M . Visualising and analysing online social networks [C ] // International Conference on Computing,Communication and Security(ICCCS) . 2016 : 1 - 6 .