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)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
SIAM Journal on Computing
Query Evaluability in Statistical Databases
IEEE Transactions on Knowledge and Data Engineering
Auditing and Inference Control in Statistical Databases
IEEE Transactions on Software Engineering
Cardinality-based inference control in data cubes
Journal of Computer Security
Auditing sum-queries to make a statistical database secure
ACM Transactions on Information and System Security (TISSEC)
An analytical approach to the inference of summary data of additive type
Theoretical Computer Science
Parity-based inference control for multi-dimensional range sum queries
Journal of Computer Security
Secure aggregation in a publish-subscribe system
Proceedings of the 7th ACM workshop on Privacy in the electronic society
Self-enforcing Private Inference Control
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
New paradigm of inference control with trusted computing
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Hi-index | 0.00 |
In an on-line statistical database, the query system should leave unanswered queries asking for sums that could lead to the disclosure of confidential data. To check that, every sum query and previously answered sum queries should be audited. We show that, under a suitable query-overlap restriction, an auditing procedure can be efficiently worked out using flow-network computation.