Abstract
In the era of big data, the open sharing of government data has increasingly attracted the attention of governments. However, there is privacy leakage risk in the government’s data sharing. For the scene of sharing the table data, this paper proposes a approach for privacy-preserving data sharing in this paper based on anonymity clustering. Firstly, we preprocess the data table, and the records in the table are clustered by k-mediods clustering algorithm. The data table is divided into multiple sub-tables according to the distance between records. Then, the data records in the sub-table are divided based on the information loss parameter value, and the anonymous table data is adjusted so that the sensitive attribute values in the equivalence class are different. Last, Laplace noises are added to the value of sensitive attribute to ensure the privacy of the shared data. Compared with the classical k-anonymous MDAV algorithm in execute time, information loss and information entropy, the experimental results show that the proposed algorithm can reduce the operating time, improve the privacy protection to some extent, and has certain availability from the three aspects.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Xiaolin, X., Ming, C.: Research on government service data sharing in the environment of digital government. Adm. Trib. 01, 50–59 (2018)
Susanto, H., Almunawar, M.N.: Security and privacy issues in cloud-based e-government. In: Cloud Computing Technologies for Connected Government, pp. 292–321. IGI Global (2016)
Yuan, Y.: Privacy Protection Method and Research in Data Sharing. Harbin Engineering University, (2014)
Zhang, Y.: Research on Sensitive Information Protection in Data Sharing. Dalian Maritime University (2012)
Xia, Z., Han, J., Juan, Yu., Guo, T.: MDAV algorithm for implementing (k, e) -anonymity model. Comput. Eng. 36(15), 159–161 (2010)
Ronglei, H., Yanqiong, H., Ping, Z., Xiaohong, F.: Design and implementation of medical privacy protection scheme in big data environment. Netinfo Secur. 9, 48–54 (2018)
Li, C.: Analysis of the research status of privacy protection under the environment of big data. Comput. Knowl. Technol. 12(18), 29–31 (2016)
Wang, B., Yang, J.: Research on anonymity technique for personalization privacy-preserving data publishing. Comput. Sci. 39(4), 168–171+200 (2012)
Zhu, T., He, M., Zou, D.: Differential privacy and applications on big data. J. Inf. Secur. Res. 1(3), 224–229 (2015)
Wu, L.: Research on Clustering Algorithm of Data Table Anonymity. Xidian University (2017)
Ren, W.: Association rules based background knowledge attack and privacy protection. Shandong University (2011)
Dwork, C.: Differential privacy. In: Proceedings of the 33rd International Conference on Automata, Languages and Programming, pp. 1–12 (2006)
Dwork, C.: Differential privacy. In: Encyclopedia of Cryptography and Security, pp. 338–340. Springer, New York (2011)
Dwork, C., Mcsherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity inprivate data analysis. In: Proceedings of the 3th Theory of Cryptography Conference (TCC), pp. 363–385 (2006)
Xie, J., Guo, W., Xie, W.: A neighborhood-based K-medoids clustering algorithm. J. Shaanxi Norm. Univ. (Nat. Sci. Ed.) 40(4), 1672–4291 (2012)
Lu, Y., Sinnott, R.O., Verspoor, K.: A semantic-based k-anonymity scheme for health record linkage. Stud. Health Technol. Inform. 239, 84–90 (2017)
Liu, X., Li, Q.: Differentially private data release based on clustering anonymization. J. Commun. 37(5), 125–129 (2016)
Chunhui, P., Yajuan, S., Jiaqi, Y., et al.: Privacy-preserving governmental data publishing: A fog-computing-based differential privacy approach. Future Generation Computer Systems, S0167739X18300773 (2018)
Liu, H.: Clustering-based data publishing for differential data anonymization. J. Hainan Norm. Univ. Nat. Sci. 27(01), 23–26 (2014)
Xiong, J.B., Wang, M.S., Tian, Y.L., Ma, R., Yao, Z.Q., Lin, M.W.: Research progress on privacy measurement for cloud data. Ruan Jian Xue Bao/Journal of Software 29(7), 1963–1980 (2018). (in Chinese). http://www.jos.org.cn/1000-9825/5363.htm
Shi, Y., Zhou, W., Zang, S., et al.: A comprehensive evaluation model of privacy protection based on probability statistics and del-entropy. Chin. J. Comput. 4, 786–799 (2019)
Chen, X.: Research and Implementation of Data Anonymized Privacy Protection Method. Jiangsu University of Science and Technology (2018)
Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: Fortieth annual ACM Symposium on Theory of Computing (STOC 2008). ACM (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, L., Piao, C., Cao, H. (2020). Clustering-Anonymity Method for Privacy Preserving Table Data Sharing. In: Chao, KM., Jiang, L., Hussain, O., Ma, SP., Fei, X. (eds) Advances in E-Business Engineering for Ubiquitous Computing. ICEBE 2019. Lecture Notes on Data Engineering and Communications Technologies, vol 41. Springer, Cham. https://doi.org/10.1007/978-3-030-34986-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-34986-8_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34985-1
Online ISBN: 978-3-030-34986-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)