A Hierarchical k-Anonymous Technique of Graphlet Structural Perception in Social Network Publishing
The structural information of social network data plays an important role in many fields of research. Therefore, privacy-preserving social network publication methods should preserve more structural information, such as the higher-order organizational structure of complex networks (graphlets/motifs). Therefore, how to preserve the graphlet structure information in a social network as much as possible becomes a key problem in social network privacy protection. In this paper, to address the problem of excessive loss of graphlet structural information in the privacy process of published social network data, we proposed a technique of hierarchical k-anonymity for graphlet structural perception. The method considers the degree of social network nodes according to the characteristics of the power-law distribution. The nodes are divided according to the degrees, and the method analyzes the graphlet structural features of the graph in the privacy process and adjusts the privacy-processing strategies of the edges according to the graphlet structural features. This is done, in order to meet the privacy requirement while protecting the graphical structural information in the social network and, improving the utility of the data. This paper uses two real public data sets, WebKB and Cora, and conducted experiments and evaluations. Finally, the experimental results show that the method proposed in this paper can concurrently provide the same privacy protection intensity, better maintain the social network’s structural information and improve the data’s utility.
KeywordsSocial networks Graphlet Privacy protection Hierarchical k-anonymity
The research is supported by the National Science Foundation of China (Nos. 61672176, 61662008, 61502111), Guangxi “Bagui Scholar” Teams for Innovation and Research Project, the Guangxi Collaborative Center of Multi-source Information Integration and Intelligent Processing, Guangxi Natural Science Foundation (Nos. 2015GXNSFBA139246, 2016GXNSFAA380192), and the Innovation Project of Guangxi Graduate Education (Nos. YCSZ2015104, 2018KY0082).
- 4.Cormode, G., Srivastava, D., Bhagat, S., Krishnamurthy, B.: Class-based graph anonymization for social network data. PVLDB 2(1), 766–777 (2009)Google Scholar
- 5.Cormode, G., Srivastava, D., Yu, T., Zhang, Q.: Anonymizing bipartite graph data using safe groupings. PVLDB 1(1), 833–844 (2008)Google Scholar
- 7.Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD Conference, pp. 93–106 (2008)Google Scholar
- 8.Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE, pp. 506–515 (2008)Google Scholar
- 9.Thompson, B., Yao, D.: The union-split algorithm and cluster-based anonymization of social networks. In: ASIACCS, pp. 218–227 (2009)Google Scholar
- 10.Zou, L., Chen, L., Özsu, M.T.: K-automorphism: a general framework for privacy preserving network publication. PVLDB 2(1), 946–957 (2009)Google Scholar
- 11.Wu, W., Xiao, Y., Wang, W., He, Z., Wang, Z.: k-symmetry model for identity anonymization in social networks. In: EDBT, pp. 111–122 (2010)Google Scholar
- 12.Hay, M., Miklau, G., Jensen, D., Weis, P., Srivastava, S.: Anonymizing social networks. University of Massachusetts, Technical report 07-19 (2007)Google Scholar
- 13.Ying, X., Pan, K., Wu, X., Guo, L.: Comparisons of randomization and k-degree anonymization schemes for privacy preserving social network publishing. In: SNA-KDD, pp. 1–10 (2009)Google Scholar
- 17.Wang, H.: Research on anonymous method of effectively preserving the community structure for social network data publication. Guangxi Normal University, Guilin (2016)Google Scholar
- 18.Task, C., Clifton, C.: A guide to differential privacy theory in social network analysis. In: IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 411–417. IEEE (2013)Google Scholar