Suppressing marginal totals from a two-dimensional table to protect sensitive information

Authors:
F. M. Malvestuto;M. Moscarini
Affiliations:
Department of Information Sciences, ’La Sapienza‘ University of Rome, Via Salaria 113, I-00198 Rome, Italy;Department of Information Sciences, ’La Sapienza‘ University of Rome, Via Salaria 113, I-00198 Rome, Italy
Venue:
Statistics and Computing
Year:
1997

Citing 12
Cited 3

Theory of linear and integer programming

Theory of linear and integer programming
Some new matroids on graphs: cut sets and the max cut problem

Mathematics of Operations Research
A graph theoretic approach to statistical data security

SIAM Journal on Computing
Security-control methods for statistical databases: a comparative study

ACM Computing Surveys (CSUR)
Suppressing marginal cells to protect sensitive information in a two-dimensional statistical table (extended abstract)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient detection and protection of information in cross tabulated tables I: linear invariant test

SIAM Journal on Discrete Mathematics
A universal-scheme approach to statistical databases containing homogeneous summary tables

ACM Transactions on Database Systems (TODS)
Graph Algorithms

Graph Algorithms
Data Structures and Algorithms

Data Structures and Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Query Evaluability in Statistical Databases

IEEE Transactions on Knowledge and Data Engineering
Graph Theory With Applications

Graph Theory With Applications

Security Problems for Statistical Databases with General Cell Suppressions

SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Privacy in multidimensional databases

Multidimensional databases
Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

The technique of data suppression for protecting sensitive information in a two-dimensional table from exact disclosure raises the computational problems of testing a given table of censored data for security, and searching for a secure suppression pattern of minimum size for a given table. We provide a polynomial security test to solve the former problem, and prove that the latter problem is intractable in the general case, but can be solved in linear time in the special case in which only sensitive cells are to be protected.