Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hay, M., Miklau, G., Jensen, D., Towsley, D.: Resisting structural re-identification in anonymized social networks. Proc. VLDB Endow. 1(1), 102–114 (2008)
Campan, A., Truta, T.M.: Data and structural k-anonymity in social networks. In: Bonchi, F., Ferrari, E., Jiang, W., Malin, B. (eds.) PInKDD 2008. LNCS, vol. 5456, pp. 33–54. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01718-6_4
Tassa, T., Cohen, D.: Anonymization of centralized and distributed social networks by sequential clustering. IEEE Trans. Knowl. Data Eng. 25(2), 311–324 (2012)
Cormode, G., Srivastava, D., Bhagat, S., Krishnamurthy, B.: Class-based graph anonymization for social network data. PVLDB 2(1), 766–777 (2009)
Cormode, G., Srivastava, D., Yu, T., Zhang, Q.: Anonymizing bipartite graph data using safe groupings. PVLDB 1(1), 833–844 (2008)
Zheleva, E., Getoor, L.: Preserving the privacy of sensitive relationships in graph data. In: Bonchi, F., Ferrari, E., Malin, B., Saygin, Y. (eds.) PInKDD 2007. LNCS, vol. 4890, pp. 153–171. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78478-4_9
Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD Conference, pp. 93–106 (2008)
Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE, pp. 506–515 (2008)
Thompson, B., Yao, D.: The union-split algorithm and cluster-based anonymization of social networks. In: ASIACCS, pp. 218–227 (2009)
Zou, L., Chen, L., Özsu, M.T.: K-automorphism: a general framework for privacy preserving network publication. PVLDB 2(1), 946–957 (2009)
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)
Hay, M., Miklau, G., Jensen, D., Weis, P., Srivastava, S.: Anonymizing social networks. University of Massachusetts, Technical report 07-19 (2007)
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)
Casas-Roma, J., Herrera-Joancomartí, J., Torra, V.: k-degree anonymity and edge selection: improving data utility in large networks. Knowl. Inf. Syst. 50, 447 (2017)
Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209–223 (1997)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationship of the internet topology. In: ACM SIGCOMM. ACM Press, Cambridge (1999)
Wang, H.: Research on anonymous method of effectively preserving the community structure for social network data publication. Guangxi Normal University, Guilin (2016)
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)
Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163–166 (2016)
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, vol. 8. Cambridge University Press, Cambridge (1994)
Li, A., Pan, Y.: Structural information and dynamical complexity of networks. IEEE Trans. Inf. Theory 62(6), 3290–3339 (2016)
http://linqs.umiacs.umd.edu/projects//projects/lbc/index.html
Acknowledgment
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).
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Yu, D., Zhao, H., Wang, Le., Liu, P., Li, X. (2019). A Hierarchical k-Anonymous Technique of Graphlet Structural Perception in Social Network Publishing. In: Renault, É., Boumerdassi, S., Bouzefrane, S. (eds) Mobile, Secure, and Programmable Networking. MSPN 2018. Lecture Notes in Computer Science(), vol 11005. Springer, Cham. https://doi.org/10.1007/978-3-030-03101-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-03101-5_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03100-8
Online ISBN: 978-3-030-03101-5
eBook Packages: Computer ScienceComputer Science (R0)