Matching Attacks on Non-deterministic Algorithms for Cell Suppression Problem for Tabular Data

The objective of the cell suppression problem (CSP) is to protect sensitive cell values in tabular data under the presence of linear relations concerning marginal sums. Previous algorithms for solving CSPs ensure that every sensitive cell has enough uncertainty on its values based on the interval wi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2022 IEEE International Conference on Big Data (Big Data) s. 2169 - 2174
Hlavní autoři: Abe, Yutaka, Minami, Kazuhiro
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 17.12.2022
Témata:
Big Data
cell suppression problem
Computational efficiency
integer linear programming
Linear programming
Pattern matching
statistical disclosure control
Uncertainty
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The objective of the cell suppression problem (CSP) is to protect sensitive cell values in tabular data under the presence of linear relations concerning marginal sums. Previous algorithms for solving CSPs ensure that every sensitive cell has enough uncertainty on its values based on the interval width of all possible values. However, every deterministic CSP algorithm is vulnerable to an attack scheme that narrows down the width of sensitive cell values by matching the suppression pattern of an original table with that of each candidate table with the same CSP algorithm. Although to make a CSP algorithm non-deterministic is a promising approach against the matching attack, we find that there still exists an expanded matching attack to the algorithm.
DOI:10.1109/BigData55660.2022.10020718