Dynamic social privacy protection based on graph mode partition in complex social network

12Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Differential privacy protection model provides strict and quantitative risk representation for privacy disclosure, which greatly ensures the availability of data. However, most existing methods do not consider the semantic context, so they are vulnerable to attacks based on semantic information. Therefore, dynamic social privacy protection based on graph pattern partitioning is designed to satisfy differential privacy protection. Firstly, the structure of social network is represented as a graph model, and the original graph is classified into several sub-graphs according to the characteristics of nodes. Then, the dense area of each sub-graph is divided by quad-tree method, and the noise of differential privacy protection is added to the leaf nodes of the tree, and the graph publishing is generated by sub-graph reconstruction. Finally, the feasibility and practicability of the model are verified by statistical analysis, such as degree distribution, shortest path, and clustering coefficient. The simulation results show the validity and applicability of the privacy protection method proposed in this paper.

Cite

CITATION STYLE

APA

Qiuyang, G., Qilian, N., Xiangzhao, M., & Zhijiao, Y. (2019). Dynamic social privacy protection based on graph mode partition in complex social network. Personal and Ubiquitous Computing, 23(3–4), 511–519. https://doi.org/10.1007/s00779-019-01249-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free