ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION

Carnegie Mellon University

Indexed incrossref

Abstract

Often a data holder, such as a hospital or bank, needs to share person-specific records in such a way that the identities of the individuals who are the subjects of the data cannot be determined. One way to achieve this is to have the released records adhere to k-anonymity, which means each released record has at least (k-1) other records in the release whose values are indistinct over those fields that appear in external data. So, k-anonymity provides privacy protection by guaranteeing that each released record will relate to at least k individuals even if the records are directly linked to external information. This paper provides a formal presentation of combining generalization and suppression to achieve…

Citation impact

1,971
total citations
FWCI
14.92
Percentile
100%
References
6
Citations per year

Authors

1

Topics & keywords

Keywords
  • k-anonymity
  • Anonymity
  • Generalization
  • Heuristics
  • Computer science
  • Computer security
  • Value (mathematics)
  • Distortion (music)
UN Sustainable Development Goals
  • Peace, Justice and strong institutions
No related works found for this paper.