Netinfo Security ›› 2020, Vol. 20 ›› Issue (10): 19-26.doi: 10.3969/j.issn.1671-1122.2020.10.003

Previous Articles     Next Articles

Research on k-anonymity Algorithm for Personalized Quasi-identifier Attributes

HE Jingsha, DU Jinhui(), ZHU Nafei   

  1. Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China
  • Received:2020-07-03 Online:2020-10-10 Published:2020-11-25
  • Contact: DU Jinhui E-mail:1290344719@qq.com

Abstract:

k-anonymity can solve the problem of link attack in the field of privacy protection to a great extent, but the existing k-anonymity model does not attach importance to personal privacy autonomy. The existing improved k-anonymity model can not meet the needs of different people for different types of data. After the data table is published, the whole table still has only one k value, that is, all tuples are unified and generalized, which can not reflect the user's personalized privacy requirements, resulting in great information loss. Based on k-anonymity model, combined with the generalization idea based on clustering, this paper proposes a k-anonymity algorithm for personalized quasi-identifier attributes(KAUP). The algorithm can effectively present different k values on the same data table according to the privacy requirements of users, so as to meet the personalized k-anonymity. This paper designs comparative experiments of runtime, information loss and scalability on dataset Adult. Experiments show that personalized anonymity on the same data table is feasible, and the information loss in the anonymity process is small, which is conducive to the personalized anonymity research of quasi-identifier attributes.

Key words: personalization, k-anonymity, privacy protection

CLC Number: