On the complexity of restricted k-anonymity problem

Sun, Xiaoxun and Wang, Hua and Li, Jiuyong (2008) On the complexity of restricted k-anonymity problem. In: APWeb 2008: 10th Asia-Pacific Web Conference, 26-28 Apr 2008, Shenyang, China.

Preview	Text (Accepted version) Sun_Wang_Jiuyong_Author's_version.pdf Download (215Kb)
Preview	Text (Documentation) Asia-Pacific_Web_Conference_2008.pdf Download (215Kb)

Abstract

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 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.

Statistics for this ePrint Item

Item Type:	Conference or Workshop Item (Commonwealth Reporting Category E) (Paper)
Refereed:	Yes
Item Status:	Live Archive
Additional Information:	Series title: Lecture Notes in Computer Science, v. 4976 Deposited in accordance with the copyright policy of the publisher. Copyright 2008 Springer. This is the authors' version of the work. It is posted here with permission of the publisher for your personal use. No further distribution is permitted.
Faculty / Department / School:	Historic - Faculty of Sciences - Department of Maths and Computing
Date Deposited:	20 Jun 2008 02:39
Last Modified:	28 Aug 2014 04:08
Uncontrolled Keywords:	k-anonymity; database security
Fields of Research :	08 Information and Computing Sciences > 0802 Computation Theory and Mathematics > 080201 Analysis of Algorithms and Complexity 08 Information and Computing Sciences > 0803 Computer Software > 080303 Computer System Security 08 Information and Computing Sciences > 0804 Data Format > 080499 Data Format not elsewhere classified
Socio-Economic Objective:	E Expanding Knowledge > 97 Expanding Knowledge > 970108 Expanding Knowledge in the Information and Computing Sciences
Identification Number or DOI:	10.1007/978-3-540-78849-2_30
URI:	http://eprints.usq.edu.au/id/eprint/4223

Actions (login required)

Archive Repository Staff Only