The paper defines and analyzes k-multiset antiresolving sets, the basis for a multiset variant of (k, ℓ)-anonymity, and provides an ILP to compute the minimum attacker set size.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the $(k,\ell)$-multiset anonymity measure for social graphs
The paper defines and analyzes k-multiset antiresolving sets, the basis for a multiset variant of (k, ℓ)-anonymity, and provides an ILP to compute the minimum attacker set size.