\(k\)-attribute-anonymity is hard even for \(k=2\) (Q477690)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(k\)-attribute-anonymity is hard even for \(k=2\) |
scientific article |
Statements
\(k\)-attribute-anonymity is hard even for \(k=2\) (English)
0 references
9 December 2014
0 references
computational complexity
0 references
database privacy
0 references
data anonymization
0 references
fixed parameter tractability
0 references
NP-hardness
0 references
0 references
