Extended k-anonymity models against sensitive attribute disclosure

Sun, Xiaoxun and Sun, Lili and Wang, Hua (2011) Extended k-anonymity models against sensitive attribute disclosure. Computer Communications , 34 (4). pp. 526-535. ISSN 0140-3664

Abstract

p-Sensitive k-anonymity model has been recently defined as a sophistication of k-anonymity. This new property requires that there be at least p distinct values for each sensitive attribute within the records sharing a set of quasi-identifier attributes. In this paper, we identify the situations when the p-sensitive k-anonymity property is not enough for the sensitive attributes protection. To overcome the shortcoming of the p-sensitive k-anonymity principle, we propose two new enhanced privacy requirements, namely pþ-sensitive k-anonymity and ðp; aÞ-sensitive k-anonymity properties. These two new introduced models target at different perspectives. Instead of focusing on the specific values of sensitive attributes, pþ-sensitive k-anonymity model concerns more about the categories that the values belong to. Although ðp; aÞsensitive k-anonymity model still put the point on the specific values, it includes an ordinal metric system to measure how much the specific sensitive attribute values contribute to each QI-group. We make a thorough theoretical analysis of hardness in computing the data set that satisfies either pþ-sensitive kanonymity or ðp; aÞ-sensitive k-anonymity. We devise a set of algorithms using the idea of top-down specification, which is clearly illustrated in the paper. We implement our algorithms on two real-world data sets and show in the comprehensive experimental evaluations that the two new introduced models are superior to the previous method in terms of effectiveness and efficiency.


Statistics for USQ ePrint 18264
Statistics for this ePrint Item
Item Type: Article (Commonwealth Reporting Category C)
Refereed: Yes
Item Status: Live Archive
Additional Information: Author version not held.
Depositing User: Dr Hua Wang
Faculty / Department / School: Historic - Faculty of Sciences - Department of Maths and Computing
Date Deposited: 25 Feb 2011 00:35
Last Modified: 19 Aug 2014 06:33
Uncontrolled Keywords: k-anonymity; NP-hard; attribute disclosure; algorithm
Fields of Research (FOR2008): 08 Information and Computing Sciences > 0802 Computation Theory and Mathematics > 080299 Computation Theory and Mathematics not elsewhere classified
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
Socio-Economic Objective (SEO2008): B Economic Development > 89 Information and Communication Services > 8902 Computer Software and Services > 890299 Computer Software and Services not elsewhere classified
Identification Number or DOI: doi: 10.1016/j.comcom.2010.03.020
URI: http://eprints.usq.edu.au/id/eprint/18264

Actions (login required)

View Item Archive Repository Staff Only