Please use this identifier to cite or link to this item:
|Title:||SABRE: A Sensitive Attribute Bucketization and REdistribution framework for t-closeness||Authors:||Cao, J.
|Keywords:||Earth Mover's Distance
|Issue Date:||2011||Citation:||Cao, J., Karras, P., Kalnis, P., Tan, K.-L. (2011). SABRE: A Sensitive Attribute Bucketization and REdistribution framework for t-closeness. VLDB Journal 20 (1) : 59-81. ScholarBank@NUS Repository. https://doi.org/10.1007/s00778-010-0191-9||Abstract:||Today, the publication of microdata poses a privacy threat: anonymous personal records can be re-identified using third data sources. Past research has tried to develop a concept of privacy guarantee that an anonymized data set should satisfy before publication, culminating in the notion of t-closeness. To satisfy t-closeness, the records in a data set need to be grouped into Equivalence Classes (ECs), such that each EC contains records of indistinguishable quasi-identifier values, and its local distribution of sensitive attribute (SA) values conforms to the global table distribution of SA values. However, despite this progress, previous research has not offered an anonymization algorithm tailored for t-closeness. In this paper, we cover this gap with SABRE, a SA Bucketization and REdistribution framework for t-closeness. SABRE first greedily partitions a table into buckets of similar SA values and then redistributes the tuples of each bucket into dynamically determined ECs. This approach is facilitated by a property of the Earth Mover's Distance (EMD) that we employ as a measure of distribution closeness: If the tuples in an EC are picked proportionally to the sizes of the buckets they hail from, then the EMD of that EC is tightly upper-bounded using localized upper bounds derived for each bucket. We prove that if the t-closeness constraint is properly obeyed during partitioning, then it is obeyed by the derived ECs too. We develop two instantiations of SABRE and extend it to a streaming environment. Our extensive experimental evaluation demonstrates that SABRE achieves information quality superior to schemes that merely applied algorithms tailored for other models to t-closeness, and can be much faster as well. © 2010 Springer-Verlag.||Source Title:||VLDB Journal||URI:||http://scholarbank.nus.edu.sg/handle/10635/39486||ISSN:||10668888||DOI:||10.1007/s00778-010-0191-9|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.