Security Problems for Statistical Databases with General Cell Suppressions
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Minimal invariant sets in a vertex-weighted graph
Theoretical Computer Science
An analytical approach to the inference of summary data of additive type
Theoretical Computer Science
Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
The bridge-connectivity augmentation problem with a partition constraint
Theoretical Computer Science
| Hi-index | 0.00 |
To protect sensitive information in a cross-tabulated table, it is a common practice to suppress some of the cells in the table. An analytic invariant is a power series in terms of the suppressed cells that has a unique feasible value and a convergence radius equal to $+\infty$. Intuitively, the information contained in an invariant is not protected even though the values of the suppressed cells are not disclosed. This paper gives an optimal linear-time algorithm for testing whether there exist nontrivial analytic invariants in terms of the suppressed cells in a given set of suppressed cells. This paper also presents NP-completeness results and an almost linear-time algorithm for the problem of suppressing the minimum number of cells in addition to the sensitive ones so that the resulting table does not leak analytic-invariant information about a given set of suppressed cells.