The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization recently proposed is the k-anonymity. This approach requires that the rows in a table are clustered in sets of size at least k and that all the rows in a cluster are related to the same tuple, after the suppression of some records. The problem has been shown to be NP-hard when the values are over a ternary alphabet, k = 3 and the rows length is unbounded. In this paper we give a lower bound on the approximation of two restrictions of the problem, when the records values are over a binary alphabet and k = 3, and when the records have length at most 8 and k = 4, showing that these restrictions of the problem are APX-hard. © 2009 Springer Berlin Heidelberg
Bonizzoni, P., Della Vedova, G., & Dondi, R. (2009). The k-anonymity Problem is Hard. In Proceedings 17th International Symposium on Fundamentals of Computation Theory (FCT 2009) (pp.26-37). Springer Verlag.
Citazione: | Bonizzoni, P., Della Vedova, G., & Dondi, R. (2009). The k-anonymity Problem is Hard. In Proceedings 17th International Symposium on Fundamentals of Computation Theory (FCT 2009) (pp.26-37). Springer Verlag. |
Tipo: | paper |
Carattere della pubblicazione: | Scientifica |
Presenza di un coautore afferente ad Istituzioni straniere: | No |
Titolo: | The k-anonymity Problem is Hard |
Autori: | Bonizzoni, P; Della Vedova, G; Dondi, R |
Autori: | |
Data di pubblicazione: | 2009 |
Lingua: | English |
Nome del convegno: | 17th International Symposium on Fundamentals of Computation Theory (FCT 2009) SEP 02-04 |
ISBN: | 978-3-642-03408-4 |
Serie: | LNCS |
Appare nelle tipologie: | 02 - Intervento a convegno |