Generating microdata with p-sensitive k-anonymity property

  • Authors:
  • Traian Marius Truta;Alina Campan;Paul Meyer

  • Affiliations:
  • Department of Computer Science, Northern Kentucky University, Highland Heights, KY;Department of Computer Science, Babes-Bolyai University, Cluj-Napoca, RO, Romania;Department of Computer Science, Northern Kentucky University, Highland Heights, KY

  • Venue:
  • SDM'07 Proceedings of the 4th VLDB conference on Secure data management
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Existing privacy regulations together with large amounts of available data have created a huge interest in data privacy research. A main research direction is built around the k-anonymity property. Several shortcomings of the k-anonymity model have been fixed by new privacy models such as p-sensitive k-anonymity, l-diversity, (α, k)-anonymity, and t-closeness. In this paper we introduce the Enhanced PK Clustering algorithm for generating p-sensitive k- anonymous microdata based on frequency distribution of sensitive attribute values. The p-sensitive k-anonymity model and its enhancement, extended p- sensitive k-anonymity, are described, their properties are presented, and two diversity measures are introduced. Our experiments have shown that the proposed algorithm improves several cost measures over existing algorithms.