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...

Full description

Bibliographic Details

Published in:	2022 IEEE International Conference on Big Data (Big Data) pp. 2169 - 2174
Main Authors:	Abe, Yutaka, Minami, Kazuhiro
Format:	Conference Proceeding
Language:	English Japanese
Published:	IEEE 17.12.2022
Subjects:	Big Data cell suppression problem Computational efficiency integer linear programming Linear programming Pattern matching statistical disclosure control Uncertainty
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!