Privacy-Preserving Approach PBCN in Social Network With Differential Privacy

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 disturbor anonymize their individual data before publishing them, for the purpose of privacy protection. Due to the characteristics of high...

Full description

Saved in:
Bibliographic Details
Published in:IEEE eTransactions on network and service management 2020-06, Vol.17 (2), p.931-945
Main Authors: Huang, Haiping, Zhang, Dongjun, Xiao, Fu, Wang, Kai, Gu, Jiateng, Wang, Ruchuan
Format: Article
Language:English
Subjects:
Algorithms
Availability
Clustering
Clustering algorithms
Computer simulation
Differential privacy
graph structure
Noise generation
Performance assessment
Perturbation methods
Privacy
privacy protection measure
randomization
Sensitivity
social network
Social networking (online)
Social networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 disturbor 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.
ISSN:1932-4537
1932-4537
DOI:10.1109/TNSM.2020.2982555