The problem of publishing personal data without giving up privacy is becoming increasingly important. A precise formalization that has been recently proposed is the k-anonymity, where the rows of a table are partitioned in clusters of size at least k and all rows in a cluster become the same tuple after the suppression of some entries. The natural optimization problem, where the goal is to minimize the number of suppressed entries, is hard even when the stored values are over a binary alphabet or the table consists of a bounded number of columns. In this paper we study how the complexity of the problem is influenced by different parameters. First we show that the problem is W-hard when parameterized by the value of the solution (and k). Then we exhibit a fixed-parameter algorithm when the problem is parameterized by the number of columns and the number of different values in any column.

Bonizzoni, P., DELLA VEDOVA, G., Dondi, R., Pirola, Y. (2011). Parameterized Complexity of k-Anonymity: Hardness and Tractability. In Combinatorial Algorithms (pp.242-255). Berlin/Heidelberg : Springer [10.1007/978-3-642-19222-7_25].

### Parameterized Complexity of k-Anonymity: Hardness and Tractability

#### Abstract

The problem of publishing personal data without giving up privacy is becoming increasingly important. A precise formalization that has been recently proposed is the k-anonymity, where the rows of a table are partitioned in clusters of size at least k and all rows in a cluster become the same tuple after the suppression of some entries. The natural optimization problem, where the goal is to minimize the number of suppressed entries, is hard even when the stored values are over a binary alphabet or the table consists of a bounded number of columns. In this paper we study how the complexity of the problem is influenced by different parameters. First we show that the problem is W-hard when parameterized by the value of the solution (and k). Then we exhibit a fixed-parameter algorithm when the problem is parameterized by the number of columns and the number of different values in any column.
##### Scheda breve Scheda completa Scheda completa (DC) paper
algorithms; computational complexity; parameterized complexity; anonymization
English
International Workshop on Combinatorial Algorithms (IWOCA) 26-28 July
2010
Combinatorial Algorithms
978-3-642-19221-0
2011
6460
242
255
reserved
Bonizzoni, P., DELLA VEDOVA, G., Dondi, R., Pirola, Y. (2011). Parameterized Complexity of k-Anonymity: Hardness and Tractability. In Combinatorial Algorithms (pp.242-255). Berlin/Heidelberg : Springer [10.1007/978-3-642-19222-7_25].
File in questo prodotto:
File
conf-paper-11-iwoca.pdf

Solo gestori archivio

Descrizione: Articolo principale
Dimensione 263.46 kB
Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/10281/19833`
• 4
• 2