Privacy-Preserving Approach PBCN in Social Network With Differential Privacy
- 23 March 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 17 (2) , 931-945
Abstract
Currently, lots of real social relations in social networks force users to face the potential risk of privacy leakage. Consequently, data holders would like to disturb or anonymize their individual data before publishing them, for the purpose of privacy protection. Due to the characteristics of high sensitivity and large volume data of social network graph structure, it is difficult for privacy protection schemes to enable a reasonable allocation of noises while keeping desirable data availability and execution efficiency. On the basis of differential privacy model, combining with clustering and randomization algorithms, a privacy protection approach PBCN (Privacy Preserving Approach Based on Clustering and Noise) is proposed. This proposal is composed of five algorithms including random disturbance based on clustering, graph reconstruction after disturbing degree sequence and noise nodes generation, etc. Furthermore, a privacy measure algorithm based on adjacency degree is put forward in order to objectively evaluate the privacy-preserving strength of various schemes against graph structure and degree attacks. Simulation experiments are conducted to achieve performance comparisons between PBCN, Spctr Add/Del, Spctr Switch, DER and HPDP. The experimental results show that PBCN realizes more satisfactory data availability and execution efficiency. Finally, parameters utility analysis demonstrates PBCN can achieve a “trade-off” between data availability and privacy protection level.Keywords
Funding Information
- National Natural Science Foundation of China (61672297)
- Key Research and Development Program of Jiangsu Province (BE2017742)
- The Sixth Talent Peaks Project of Jiangsu Province (DZXX-017)
- Jiangsu Natural Science Foundation for Excellent Young Scholar (BK20170039, BK20160089)
This publication has 21 references indexed in Scilit:
- Differentially private network data release via structural inference2014
- Correlated network data publication via differential privacyThe VLDB Journal, 2013
- Differentially private data analysis of social networks via restricted sensitivity2013
- Analyzing Graphs with Node Differential Privacy2013
- Delineating social network data anonymization via random edge perturbation2012
- Sharing graphs using differentially private graph models2011
- The k-anonymity and l-diversity approaches for privacy preservation in social networks against neighborhood attacksKnowledge and Information Systems, 2010
- Randomizing Social Networks: a Spectrum Preserving Approach2008
- Calibrating Noise to Sensitivity in Private Data Analysis2006
- R-MAT: A Recursive Model for Graph Mining2004