General techniques for comparing unrooted evolutionary trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Partial cell suppression: A new methodology for statistical disclosure control
Statistics and Computing
Extending Cell Suppression to Protect Tabular Data against Several Attackers
Inference Control in Statistical Databases, From Theory to Practice
On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Security Problems for Statistical Databases with General Cell Suppressions
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Archipelago: A Network Security Analysis Tool
LISA '03 Proceedings of the 17th USENIX conference on System administration
Minimal invariant sets in a vertex-weighted graph
Theoretical Computer Science
Statistical confidentiality: Optimization techniques to protect tables
Computers and Operations Research
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
Suppressing microdata to prevent classification based inference
The VLDB Journal — The International Journal on Very Large Data Bases
| 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. This paper investigates four levels of data security of a two-dimensional table concerning the effectiveness of this practice. These four levels of data security protect the information contained in, respectively, individual cells, individual rows and columns, several rows or columns as a whole, and a table as a whole. The paper presents efficient algorithms and NP-completeness results for testing and achieving these four levels of data security. All these complexity results are obtained by means of fundamental equivalences between the four levels of data security of a table and four types of connectivity of a graph constructed from that table.