Please use this identifier to cite or link to this item:
|Title:||Towards a privacy diagnosis centre: Measuring k-anonymity|
|Citation:||Mirakabad, M.R.Z., Jantan, A., Bressan, S. (2008). Towards a privacy diagnosis centre: Measuring k-anonymity. Proceedings - International Symposium on Computer Science and Its Applications, CSA 2008 : 102-107. ScholarBank@NUS Repository. https://doi.org/10.1109/CSA.2008.44|
|Abstract:||Most of the recent efforts addressing the issue of privacy have focused on devising algorithms for the anonymization and diversification of data. Our objective is upstream of these works: we are concerned with privacy diagnosis. In this paper, we start by investigating the issue of k-anonymity. We propose algorithms to explore various questions about k-anonymity of data. Such questions are, for instance, "is my data sufficiently anonymous?", "which information, if available from an outside source, threatens the anonymity of my data?" In this paper we focus on anonymity and, in particular, k-anonymity. The algorithms that we propose leverage two properties of k-anonymity that we express in the form of two lemmas. The first lemma is a monotonicity property that enables us to adapt the a-priori algorithm for k-anonymity. The second lemma is a determinism property that enables us to devise an efficient algorithm for δ-suppression. We illustrate and empirically analyze the performance of the proposed algorithms. © 2008 IEEE.|
|Source Title:||Proceedings - International Symposium on Computer Science and Its Applications, CSA 2008|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 14, 2019
WEB OF SCIENCETM
checked on Mar 6, 2019
checked on Mar 10, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.