20 20

Transactions on
Data Privacy
Foundations and Technologies

http://www.tdp.cat


Articles in Press

Accepted articles here

Latest Issues

Year 2017

Volume 10 Issue 2
Volume 10 Issue 1

Year 2016

Volume 9 Issue 3
Volume 9 Issue 2
Volume 9 Issue 1

Year 2015

Volume 8 Issue 3
Volume 8 Issue 2
Volume 8 Issue 1

Year 2014

Volume 7 Issue 3
Volume 7 Issue 2
Volume 7 Issue 1

Year 2013

Volume 6 Issue 3
Volume 6 Issue 2
Volume 6 Issue 1

Year 2012

Volume 5 Issue 3
Volume 5 Issue 2
Volume 5 Issue 1

Year 2011

Volume 4 Issue 3
Volume 4 Issue 2
Volume 4 Issue 1

Year 2010

Volume 3 Issue 3
Volume 3 Issue 2
Volume 3 Issue 1

Year 2009

Volume 2 Issue 3
Volume 2 Issue 2
Volume 2 Issue 1

Year 2008

Volume 1 Issue 3
Volume 1 Issue 2
Volume 1 Issue 1


Volume 10 Issue 2


Fine granular proximity breach prevention during numerical data anonymization

Reza Mortazavi(a),(*), Saeed Jalili(b)

Transactions on Data Privacy 10:2 (2017) 117 - 144

Abstract, PDF

(a) School of Engineering, Damghan University, Damghan, Iran.

(b) Computer Engineering Department, Tarbiat Modares University, Tehran, Iran.

e-mail:r_mortazavi @du.ac.ir; sjalili @modares.ac.ir


Abstract

Microaggregation is known as a successful perturbative mechanism to realize k-anonymity. The method partitions the dataset into groups of at least k members and then aggregates the group members. These aggregated values are published instead of the original ones. In conventional microaggregation methods, it is desired to produce a protected dataset similar to the original one, so close data records are grouped into the same cluster. Accordingly, the aggregation phase of the algorithms are designed to minimize the sum of within-group squared error (SSE), and therefore a simple arithmetic mean in each group is utilized within the aggregation phase to compute the centroids. However, this trivial approach does not consider the proximity of the published values to the original ones, so intruders are able to limit the range of the original values with respect to published data. In this paper, a proximity-aware microaggregation post-processing algorithm is proposed that revisits the aggregation step to remedy this deficiency. Additionally, it is possible to consider different levels of minimum required distances between original record values and their corresponding published ones. Empirical results confirm the superiority of the proposed method in achieving a better trade-off point between disclosure risk and information loss in comparison with similar microaggregation techniques.

* Corresponding author.

Follow us




Supports










ISSN: 1888-5063; ISSN (Digital): 2013-1631; D.L.:B-11873-2008; Web Site: http://www.tdp.cat/
Contact: Transactions on Data Privacy; Vicenç Torra; U. of Skövde; PO Box 408; 54128 Skövde; (Sweden); e-mail:tdp@tdp.cat

 


Vicenç Torra, Last modified: 07 : 47 August 27 2017.