Title: Privacy preservation in relational data through l-diversity and recursive (c, l) diversity anonymisation

Authors: Saptarshi Chakraborty; B.K. Tripathy

Addresses: School of Computer Science and Engineering, VIT University, Vellore – 632014, Tamil Nadu, India ' School of Computer Science and Engineering, VIT University, Vellore – 632014, Tamil Nadu, India

Abstract: Publication of huge amount of data generated by different organisations has catalysed the interest of scientific community to analyse and extract the hidden information in it. However, this leads to the serious problem of disclosing the sensitive information associated with the respondents. Over the years, many techniques have been developed in the form of k-anonymity and its improvements in the form of l-diversity to anonymise the data tables before publication. The number of distinct l-diversity algorithms proposed so far is very few in comparison to its counterpart k-anonymity although every algorithm achieving optimal k-anonymity by attribute generalisation can be extended to achieve distinct l-diversity. Also, to the best of our knowledge there is no concrete algorithm to deal with recursive (c, l) diversity. In this paper, we propose a new approach to achieve distinct l-diversity by adding fake tuples and extend it to propose a recursive (c, l) diversity algorithm. Through various experiments and measures, we established the efficiency of our proposed algorithm over the existing algorithms on l-diversity.

Keywords: k-anonymity; l-diversity; recursive (c; l) diversity; fake tuples; privacy preservation; privacy protection; data security; anonymisation; data tables.

DOI: 10.1504/IJMMNO.2016.081899

International Journal of Mathematical Modelling and Numerical Optimisation, 2016 Vol.7 No.3/4, pp.338 - 362

Received: 01 Apr 2016
Accepted: 11 Nov 2016

Published online: 27 Jan 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article