Skip to main content

k-Anonymity

  • Living reference work entry
  • First Online:
  • 80 Accesses

Synonyms

p-Sensitive; k-Anonymity

Definition

A protected dataset is said to satisfy k-anonymity for k > 1 if, for each combination of key attribute values (e.g., address, age, gender, etc.), at least k records exist in the dataset sharing that combination [2, 3].

Key Points

If, for a given k, k-anonymity is assumed to be sufficient protection, one can concentrate on minimizing information loss with the only constraint that k-anonymity should be satisfied. This is a clean way of solving the tension between data protection and data utility. Since k-anonymity is usually achieved via generalization (equivalent to global recoding, as said above) and local suppression, minimizing information loss usually translates to reducing the number and/or the magnitude of suppressions.

k-Anonymity bears some resemblance to the underlying principle of microaggregation and is a useful concept because quasi-identifiers are usually categorical or can be categorized, i.e., they take values in a finite (and...

This is a preview of subscription content, log in via an institution.

Recommended Reading

  1. Domingo-Ferrer J, Torra V. Ordinal, continuous and heterogenerous k-anonymity through microaggregation. Data Mining Knowl Discov. 2005;11(2):195–212.

    Article  MathSciNet  Google Scholar 

  2. Samarati P. Protecting respondents’ identities in microdata release. IEEE Trans Knowl Data Eng. 2001;13(6):1010–27.

    Article  Google Scholar 

  3. Samarati P, Sweeney L. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technicalreport, SRI International; 1998.

    Google Scholar 

  4. Truta TM, Vinay B. Privacy protection: p-sensitivek-anonymity property. In: Proceedings of 2nd International Workshop on Privacy Data Management; 2006. p. 94.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Josep Domingo-Ferrer .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Domingo-Ferrer, J. (2014). k-Anonymity. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_1503-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_1503-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics