Anonymizing Tables

  • Gagan Aggarwal
  • Tomás Feder
  • Krishnaram Kenthapadi
  • Rajeev Motwani
  • Rina Panigrahy
  • Dilys Thomas
  • An Zhu
Conference paper

DOI: 10.1007/978-3-540-30570-5_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3363)
Cite this paper as:
Aggarwal G. et al. (2004) Anonymizing Tables. In: Eiter T., Libkin L. (eds) Database Theory - ICDT 2005. ICDT 2005. Lecture Notes in Computer Science, vol 3363. Springer, Berlin, Heidelberg

Abstract

We consider the problem of releasing tables from a relational database containing personal records, while ensuring individual privacy and maintaining data integrity to the extent possible. One of the techniques proposed in the literature is k-anonymization. A release is considered k-anonymous if the information for each person contained in the release cannot be distinguished from at least k–1 other persons whose information also appears in the release. In the k-Anonymityproblem the objective is to minimally suppress cells in the table so as to ensure that the released version is k-anonymous. We show that the k-Anonymity problem is NP-hard even when the attribute values are ternary. On the positive side, we provide an O(k)-approximation algorithm for the problem. This improves upon the previous best-known O(klog k)-approximation. We also give improved positive results for the interesting cases with specific values of k — in particular, we give a 1.5-approximation algorithm for the special case of 2-Anonymity, and a 2-approximation algorithm for 3-Anonymity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Gagan Aggarwal
    • 1
  • Tomás Feder
    • 1
  • Krishnaram Kenthapadi
    • 1
  • Rajeev Motwani
    • 1
  • Rina Panigrahy
    • 1
  • Dilys Thomas
    • 1
  • An Zhu
    • 1
  1. 1.Stanford University 

Personalised recommendations