Security problems for statistical databases with general cell suppressions

Abstract

Studies statistical database problems for 2D tables whose regular cells, row sums, column sums and table sums may be suppressed. Using graph-theoretical techniques, we give optimal or efficient algorithms for the query system problem, the adversary problem and the minimum complementary suppression problem. These three problems are considered for a variety of data security requirements such as those of protecting linear invariants, analytic invariants, k rows (or columns) as a whole, and a table as a whole.