Security of statistical databases: multidimensional transformation
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Secure databases: protection against user influence
ACM Transactions on Database Systems (TODS)
Linear queries in statistical databases
ACM Transactions on Database Systems (TODS)
A fast procedure for finding a tracker in a statistical database
ACM Transactions on Database Systems (TODS)
Security in statistical databases for queries with small counts
ACM Transactions on Database Systems (TODS)
A model of statistical database their security
ACM Transactions on Database Systems (TODS)
Secure statistical databases with random sample queries
ACM Transactions on Database Systems (TODS)
A security machanism for statistical database
ACM Transactions on Database Systems (TODS)
Security in Databases: A Combinatorial Study
Journal of the ACM (JACM)
The statistical security of a statistical database
ACM Transactions on Database Systems (TODS)
A study on the protection of statistical data bases
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Principles of Database Systems
Principles of Database Systems
Update handling techniques in statistical databases
SSDBM'81 Proceedings of the 1st LBL Workshop on Statistical database management
An information theoretic approach to statistical databases and their security: a preliminary report
SSDBM'83 Proceedings of the 2nd international workshop on Proceedings of the Second International Workshop on Statistical Database Management
Prior knowledge and the security of a dynamic statistical database
SSDBM'86 Proceedings of the 3rd international workshop on Statistical and scientific database management
A Bayesian approach for on-line max auditing of dynamic statistical databases
Proceedings of the 2009 EDBT/ICDT Workshops
Auditing user queries in dynamic statistical databases
Information Sciences: an International Journal
| Hi-index | 0.00 |
Partitioning is a highly secure approach to protecting statistical databases. When updates are introduced, security depends on putting restrictions on the sizes of partition sets which may be queried. To overcome this problem, attempts have been made to add “dummy” records. Recent work has shown that this leads to high information loss.This paper reconsiders the restrictions on the size of partitioning sets required to achieve a high level of security. Updates of two records at a time were studied earlier, and security was found to hold if the sizes of the partition sets were kept even. In this paper an extended model is presented, allowing very general updates to be performed. The security problem is thoroughly studied, giving if and only if conditions. The earlier result is shown to be part of a corollary to the main theorem of this paper. Alternatives to adding dummy records are presented and the practical implications of the theory for the database manager are discussed.