Optimal mixed graph augmentation
SIAM Journal on Computing
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)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A linear time algorithm for triconnectivity augmentation (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Efficient detection and protection of information in cross tabulated tables I: linear invariant test
SIAM Journal on Discrete Mathematics
Finding a smallest augmentation to biconnect a graph
SIAM Journal on Computing
A universal-scheme approach to statistical databases containing homogeneous summary tables
ACM Transactions on Database Systems (TODS)
Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
Information Processing Letters
Minimal edge-coverings of pairs of sets
Journal of Combinatorial Theory Series B
Data Security Equals Graph Connectivity
SIAM Journal on Discrete Mathematics
Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
SIAM Journal on Computing
Suppressing marginal totals from a two-dimensional table to protect sensitive information
Statistics and Computing
Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract)
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Censoring Statistical Tables to Protect Sensitive Information: Easy and Hard Problems
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Auditing and Inference Control in Statistical Databases
IEEE Transactions on Software Engineering
On four-connecting a triconnected graph
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Quantifying Privacy Leakage through Answering Database Queries
ISC '02 Proceedings of the 5th International Conference on Information Security
Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
This paper studies statistical database problems for two-dimensional 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.