Security problems on inference control for SUM, MAX, and MIN queries
Journal of the ACM (JACM)
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
A munin network for the median nerve-a case study on loops
Applied Artificial Intelligence
Security-control methods for statistical databases: a comparative study
ACM Computing Surveys (CSUR)
Security in Databases: A Combinatorial Study
Journal of the ACM (JACM)
Inference Control in Statistical Databases, From Theory to Practice
Inference Control in Statistical Databases, From Theory to Practice
Journal of Computer and System Sciences - Special issue on PODS 2000
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Auditing sum-queries to make a statistical database secure
ACM Transactions on Information and System Security (TISSEC)
Towards robustness in query auditing
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Auditing and Inference Control in Statistical Databases
IEEE Transactions on Software Engineering
A Bayesian Approach for on-Line Max Auditing
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
A Bayesian model for disclosure control in statistical databases
Data & Knowledge Engineering
A Bayesian approach for on-line max auditing of dynamic statistical databases
Proceedings of the 2009 EDBT/ICDT Workshops
Statistical analysis for comparison of the key representation database with the original database
International Journal of Business Information Systems
A bayesian approach for on-line sum/count/max/min auditing on boolean data
PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases
| Hi-index | 0.00 |
In this paper we consider the on-line max and min query auditing problem: given a private association between fields in a data set, a sequence of max and min queries that have already been posed about the data, their corresponding answers and a new query, deny the answer if a private information is inferred or give the true answer otherwise. We give a probabilistic definition of privacy and demonstrate that max and min queries, without "no duplicates" assumption, can be audited by means of a Bayesian network. Moreover, we show how our auditing approach is able to manage user prior-knowledge.