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
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
Data Structures and Algorithms
Data Structures and Algorithms
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
| Hi-index | 0.00 |
Protecting sensitive information in a two-dimensional table asked for by a statistical user of a database raises computational problems involving both the query system which should guarantee the data security, and the user who should be able to disclose sensitive data when it is unprotected. We provide a quadratic algorithm which allows the query system to test a censored table for security, and a linear algorithm to find a minimum number of suppressions sufficient for protecting all sensitive cells; however, if sensitive information refers not only to single cells but also to cell sets, we prove that the problem of minimizing the number of suppressions is NP-hard. Finally, we provide a cubic algorithm which allows a user to disclose sensitive information in a censored table.