One of the emerging concepts in microdata protection is k-anonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect private individual information and is gaining increasing popularity. k-anonymity requires that every tuple(record) in the microdata table released be indistinguishably related to no fewer than k respondents. In this paper, we introduce two new variants of the k-anonymity problem, namely, the Restricted k -anonymity problem and Restricted k -anonymity problem on attribute (where suppressing the entire attribute is allowed). We prove that both problems are -hard for k ≥ 3. The results imply the main results obtained by Meyerson and Williams. On the positive side, we develop a polynomial time algorithm for the Restricted 2-anonymity problem by giving a graphical representation of the microdata table. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Sun, X., Wang, H., & Li, J. (2008). On the complexity of restricted k-anonymity problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4976 LNCS, pp. 287–296). https://doi.org/10.1007/978-3-540-78849-2_30
Mendeley helps you to discover research relevant for your work.