Abstract
Privacy protection of individual users in social networks is becoming more and more important, thus it requires effective anonymization techniques. In this paper, we use Kruskal and Prim algorithms to model the linear programming of the minimum spanning tree. Finally, we execute the experiments on the number of anonymity solutions and time with different edge weights to analyze the Kruskal algorithm and Prim algorithm to verify their anonymity feasibility.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Change history
15 November 2021
In the originally published chapter 9 some of the paragraphs were presented in their unfinished version, which affected the readability of the paper. The sections Introduction, Preliminary and References have been revised and updated.
References
Siddula, M., Li, Y., Cheng, X., Tian, Z., Cai, Z.: Anonymization in online social networks based on enhanced equi-cardinal clustering. IEEE Trans. Comput. Soc. Syst. 6(4), 809–820 (2019)
Huang, H., Zhang, D.J., Xiao, F., Wang K., Wang, R.: Privacy-preserving approach PBCN in social network with differential privacy. IEEE Trans. Netw. Serv. Manage. 17(2), 931–945 (2020)
Safi, S.M., Movaghar, A., Mahmoodzadeh, K.S.: A framework for protecting privacy on mobile social networks. Mobile Netw. Appl. 26, 1281–1299 (2021)
Das, S., Eğecioğlu, Ö., Abbadi, A.E.: Anonimos: an LP based approach for anonymizing weighted social network graphs. IEEE Trans. Knowl. Data Eng. 24(4), 590–604 (2010)
Das, S., Eğecioğlu, Ö., Abbadi, A.E.: Anonymizing weighted social network graphs. In: IEEE International Conference on Data Engineering, pp. 904–907. IEEE, Long Beach (2010)
Zhang, X., Zhu, J.: Skeleton of weighted social network. Phys. A Stat. Mech. Appl. 392(6), 1547–1556 (2013)
Wang, S.-L., Tsai, Y.-C., Kao, H.-Y., Ting, I.-H., Hong, T.-P.: Shortest paths anonymization on weighted graphs. Int. J. Softw. Eng. Know. Eng. 23(01), 65–79 (2013)
Tsai, Y.-C., Wang, S.-L., Kao, H.-Y., Hong, T.-P.: Edge types vs privacy in k-anonymization of shortest paths. Appl. Soft Comput. 31, 348–359 (2015)
Liu, Q., Li, F., Yang, S., Wu, J.: Preserving privacy with probabilistic indistinguishability in weighted social networks. IEEE Trans. Parallel Distrib. Syst. 28(5), 1417–1429 (2017)
Dou, K., Gou, B., Kuang, L.: A privacy-preserving multimedia recommendation in the context of social network based on weighted noise injection. Multimedia Tools Appl. 78(6), 26907–26926 (2019)
Wang, D., Long, S.: Boosting the accuracy of differentially private in weighted social networks. Multimedia Tools Appl. 78(24), 34801–34817 (2019)
Walia, G.S., Jain, G., Bansal, N., Singh, K.: Adaptive weighted graph approach to generate multimodal cancelable biometric templates. IEEE Trans. Inf. Forensics Secur. 15, 1945–1958 (2020)
Zhao, P., Yu, J., Zhang, H., Qin, Z., Wang, C.: How to securely outsource finding the min-cut of undirected edge-weighted graphs. IEEE Trans. Inf. Forensics and Secur. 15, 315–328 (2020)
Yin, L., Feng, J., Xun, H., Sun, Z., Cheng, X.: A privacy-preserving federated learning for multiparty data sharing in social IoTs. IEEE Trans. Netw. Sci. Eng. 8(3), 2706–2718 (2021)
Acknowledgment
The authors declare that there is no conflict of interest regarding the publication of this paper. This work was supported in part by the National Natural Science Foundation of China (No. 62171132, No. 62102088, No. U1905211, No. 61771140), Fok Ying Tung Education Foundation (No. 171061), Natural Science Foundation of Fujian Province (No. 2021J05228), and Fujian University of Technology (No. GJ-YB-20-06).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wang, J., Wan, Z., Song, J., Huang, Y., Lin, Y., Lin, L. (2021). Anonymizing Global Edge Weighted Social Network Graphs. In: Lin, L., Liu, Y., Lee, CW. (eds) Security and Privacy in Social Networks and Big Data. SocialSec 2021. Communications in Computer and Information Science, vol 1495. Springer, Singapore. https://doi.org/10.1007/978-981-16-7913-1_9
Download citation
DOI: https://doi.org/10.1007/978-981-16-7913-1_9
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-7912-4
Online ISBN: 978-981-16-7913-1
eBook Packages: Computer ScienceComputer Science (R0)