On Finding an Inference-Proof Complete Database for Controlled Query Evaluation
Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know. By modeling the user’s a priori knowledge in an appropriate way, a CQE system can control not only plain access to database entries but also inferences made by the user. A dynamic CQE system that enforces inference control at runtime has already been investigated. In this article, we pursue a static approach that constructs an inference-proof database in a preprocessing step. The inference-proof database can respond to any query without enabling the user to infer confidential information. We illustrate the semantics of the system by a comprehensive example and state the essential requirements for an inference-proof and highly available database. We present an algorithm that accomplishes the preprocessing by combining SAT solving and “Branch and Bound”.
KeywordsControlled Query Evaluation inference control lying confidentiality of data complete database systems propositional logic SAT solving Branch and Bound
- 4.Biskup, J., Weibert, T.: Refusal in incomplete databases. In: Farkas, C., Samarati, P. (eds.) Proceedings of the 18th Annual IFIP WG 11.3 Conference on Data and Applications Security, Proceedings, pp. 143–157. Kluwer, Dordrecht (2004)Google Scholar
- 5.Chang, L., Moskowitz, I.S.: A study of inference problems in distributed databases. In: Gudes, E., Shenoi, S. (eds.) Proceedings of the 16th Annual IFIP WG 11.3 Conference on Data and Applications Security, pp. 191–204. Kluwer, Dordrecht (2002)Google Scholar
- 13.Ganai, M.K., Ashar, P., Gupta, A., Zhang, L., Malik, S.: Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. In: Proceedings of the 39th Design Automation Conference, pp. 747–750. ACM Press, New York (2002)Google Scholar
- 17.Thiffault, C., Bacchus, F., Walsh, T.: Solving non-clausal formulas with DPLL search. In: 7th International Conference on Theory and Applications of Satisfiability Testing, Online Proceedings (2004)Google Scholar
- 19.Yang, X., Li, C.: Secure XML publishing without information leakage in the presence of data inference. In: Nascimento, M.A., Özsu, M.T., Kossmann, D., Miller, R.J., Blakeley, J.A., Schiefer, K.B. (eds.) Proceedings of the 30th International Conference on Very Large Data Bases, pp. 96–107. Morgan Kaufmann, San Francisco (2004)Google Scholar