Sciweavers

APWEB
2008
Springer

On the Complexity of Restricted k-anonymity Problem

14 years 1 months ago
On the Complexity of Restricted k-anonymity Problem
Abstract. One of the emerging concepts in microdata protection is kanonymity, 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 NP-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.
Xiaoxun Sun, Hua Wang, Jiuyong Li
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where APWEB
Authors Xiaoxun Sun, Hua Wang, Jiuyong Li
Comments (0)