Security problems on inference control for SUM, MAX, and MIN queries
Journal of the ACM (JACM)
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)
Statistical and scientific databases
Statistical and scientific databases
The mod p rank of incidence matrices for connected uniform hypergraphs
European Journal of Combinatorics - Special issue dedicated to Bernt Lindstro¨m
A universal-scheme approach to statistical databases containing homogeneous summary tables
ACM Transactions on Database Systems (TODS)
Three-Dimensional Statistical Data Security Problems
SIAM Journal on Computing
A combinatoral problem in database security
Discrete Applied Mathematics
An introduction to database systems (7th ed.)
An introduction to database systems (7th ed.)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An Optimization Problem in Statistical Databases
SIAM Journal on Discrete Mathematics
Principles of Database Systems
Principles of Database Systems
Cryptography and data security
Cryptography and data security
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
SIAM Journal on Computing
Suppressing marginal totals from a two-dimensional table to protect sensitive information
Statistics and Computing
Query Evaluability in Statistical Databases
IEEE Transactions on Knowledge and Data Engineering
Cell Suppression Methodology: The Importance of Suppressing Marginal Totals
IEEE Transactions on Knowledge and Data Engineering
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
Graph Theory With Applications
Graph Theory With Applications
Auditing sum-queries to make a statistical database secure
ACM Transactions on Information and System Security (TISSEC)
Hi-index | 0.00 |
When answering queries that ask for, summary statistics, the query-system of a multidimensional database should guard confidential data, that is, it should avoid revealing (directly or indirectly) individual data, which could be exactly calculated or accurately estimated from the values of answered queries. In order to prevent the disclosure of confidential data, the query-system should be provided with an auditing procedure which, each time a new query is processed, checks that its answer does not allow a (knowledgeable) user to disclose any sensitive data. A promising approach consists in keeping track of (or auditing) answered queries by means a dynamic graphical data structure, here called the answer map, whose size increases with the number of answered queries and with the number of dimensions of the database, so that the problem of the existence of an efficient auditing procedure naturally arises. This chapter reviews recent results on this problem for "additive" queries (such as COUNT and SUM queries) by listing some polynomially solvable problems as well as some hard problems, and suggests directions for future work.