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 into clusters of sizes 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[1]-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. Finally, we prove that k-anonymity is still APX-hard even when restricting to instances with 3 columns and k=3.

Bonizzoni, P., DELLA VEDOVA, G., Dondi, R., Pirola, Y. (2013). Parameterized complexity of k-anonymity: hardness and tractability. JOURNAL OF COMBINATORIAL OPTIMIZATION, 26(1), 19-43 [10.1007/s10878-011-9428-9].

Parameterized complexity of k-anonymity: hardness and tractability

BONIZZONI, PAOLA;DELLA VEDOVA, GIANLUCA;PIROLA, YURI
2013

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 into clusters of sizes 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[1]-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. Finally, we prove that k-anonymity is still APX-hard even when restricting to instances with 3 columns and k=3.
Articolo in rivista - Articolo scientifico
Anonymity;Fixed-parameter complexity;Approximation algorithms;Hardness
English
19
43
25
Bonizzoni, P., DELLA VEDOVA, G., Dondi, R., Pirola, Y. (2013). Parameterized complexity of k-anonymity: hardness and tractability. JOURNAL OF COMBINATORIAL OPTIMIZATION, 26(1), 19-43 [10.1007/s10878-011-9428-9].
Bonizzoni, P; DELLA VEDOVA, G; Dondi, R; Pirola, Y
File in questo prodotto:
File Dimensione Formato  
journ-art-13-joco.pdf

Solo gestori archivio

Descrizione: Articolo principale
Dimensione 791.61 kB
Formato Adobe PDF
791.61 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/26490
Citazioni
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 3
Social impact