计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (28): 117-119.

• 数据库、信号与信息处理 • 上一篇    下一篇

隐私保护k-匿名算法研究

王平水1,马钦娟2   

  1. 1.安徽财经大学 管理科学与工程学院,安徽 蚌埠 233030
    2.安徽财经大学 商学院,安徽 蚌埠 233041
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-10-01 发布日期:2011-10-01

Research on k-anonymity algorithm for privacy preservation

WANG Pingshui1,MA Qinjuan2   

  1. 1.College of Management Science and Engineering,Anhui University of Finance & Economics,Bengbu,Anhui 233030,China
    2.Business Institute,Anhui University of Finance & Economics,Bengbu,Anhui 233041,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-10-01 Published:2011-10-01

摘要: 隐私保护已成为个人或组织机构关心的基本问题,k-匿名是目前数据发布环境下实现隐私保护的主要技术之一。鉴于多数k-匿名方法采用泛化和隐匿技术,严重依赖于预先定义的泛化层或属性域上的全序关系,产生很高的信息损失,降低了数据的可用性,提出了一种基于聚类技术的k-匿名算法。实验结果表明,该算法在保护隐私的同时,提高了发布数据的可用性。

关键词: 数据发布, 隐私保护, 匿名化, k-匿名, 聚类

Abstract: Privacy preservation has been an essential issue for individuals or organizations.k-anonymity is one of the primary techniques realizing privacy protection in data dissemination environment.Current k-anonymity solutions based on generalization and suppression techniques suffer from high information loss and low usability mainly due to reliance on pre-defined generalization hierarchies or order imposed on each attribute domain.It develops a new k-anonymity algorithm based on clustering technology.Experimental results show that the method can improve the usability of the released data while preserving privacy.

Key words: data dissemination, privacy-preserving, anonymization, k-anonymity, clustering