首页    期刊浏览 2024年11月07日 星期四
登录注册

文章基本信息

  • 标题:Achieving k-anonymity Using Improved Greedy Heuristics for Very Large Relational Databases
  • 本地全文:下载
  • 作者:Korra Sathya Babu ; Nithin Reddy ; Nitesh Kumar
  • 期刊名称:Transactions on Data Privacy
  • 印刷版ISSN:1888-5063
  • 电子版ISSN:2013-1631
  • 出版年度:2013
  • 卷号:6
  • 期号:1
  • 页码:1-17
  • 出版社:IIIA-CSIC
  • 摘要:

    Advances in data storage, data collection and inference techniques have enabled the creation of huge databases of personal information. Dissemination of information from such databases - even if formally anonymised, creates a serious threat to individual privacy through statistical disclosure. One of the key methods developed to limit statistical disclosure risk is k-anonymity. Several methods have been proposed to enforce k-anonymity notably Samarati's algorithm and Sweeney's Datafly, which both adhere to full domain generalisation. Such methods require a trade off between computing time and information loss. This paper describes an improved greedy heuristic for enforcing k-anonymity with full domain generalisation. The improved greedy algorithm was compared with the original methods. Metrics like information loss, computing time and level of generalisation were deployed for comparison. Results show that the improved greedy algorithm maintains a better balance between computing time and information loss.

国家哲学社会科学文献中心版权所有