A K-Anonymous Full Domain Generalization Algorithm Based on Heap Sort
K-Anonymity algorithms are used as essential methods to protect end users’ data privacy. However, state-of-art K-Anonymity algorithms have shortcomings such as lacking generalization and suppression value priority standard. Moreover, the complexity of these algorithms are usually high. Thus, a more robust and efficient K-Anonymity algorithm is needed for practical usage. In this paper, a novel K-Anonymous full domain generalization algorithm based on heap sort is presented. We first establish the k-anonymous generalization priority standard of information. Then our simulation results show the user’s data privacy can be effectively protected while generalization efficiency is also improved.
KeywordsK-anonymity Privacy Generalization Protection Quasi-identifier Generalization priority
- 7.Sai Kumar, K.: Achieving k-anonymity using parallelism in full domain generalization. Ph.D. thesis (2015)Google Scholar
- 8.Samarati, P., Sweeney, L.: Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, SRI International (1998)Google Scholar
- 9.Shi, P., Xiong, L., Fung, B.: Anonymizing data with quasi-sensitive attribute values. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 1389–1392. ACM (2010)Google Scholar