Preprocessing for controlled query evaluation with availability policy

Journal of Computer Security

Volumn 16, Issue 4, 2008, Pages 477-494

  Biskup, Joachim ^a   Wiese, Lena ^a,b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b German Research Council (DFG)

Author keywords

Availability policy; Branch and Bound; Complete database systems; Confidentiality policy; Controlled query evaluation; Inference control; Lying; Propositional logic; SAT solving

Indexed keywords

CONFIDENTIAL INFORMATION; DATABASE ENTRIES; LOGICAL FRAMEWORK (LF); PRIORI KNOWLEDGE; QUERY EVALUATION; SAT SOLVING; SECRET INFORMATIONS;

BOOLEAN FUNCTIONS; CANNING; INFORMATION THEORY;

DATABASE SYSTEMS;

EID: 48249156214     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2008-0325     Document Type: Article

References (24)

1. J. Biskup and P.A. Bonatti, Lying versus refusal for known potential secrets, Data & Knowledge Engineering 38(2) (2001), 199-222.
2. J. Biskup and P.A. Bonatti, Controlled query evaluation for enforcing confidentiality in complete information systems, International Journal of Information Security 3(1) (2004), 14-27.
3. J. Biskup and P.A. Bonatti, Controlled query evaluation for known policies by combining lying and refusal, Annals of Mathematics and Artificial Intelligence 40(1/2) (2004), 37-62.
4. J. Biskup and P.A. Bonatti, Controlled query evaluation with open queries for a decidable relational submodel, Annals of Mathematics and Artificial Intelligence 50(1/2) (2007), 39-77.
5. J. Biskup, D.M. Burgard, T. Weibert and L. Wiese, Inference control in logic databases as a constraint satisfaction problem, in: Third International Conference on Information Systems Security, Proceedings, Lecture Notes in Computer Science, Vol. 4812, Springer, Berlin, Germany, 2007, pp. 128-142.
6. J. Biskup and T. Weibert, Keeping secrets in incomplete databases, International Journal of Information Security (2007), http://www.springerlink.com/content/g0565w1705t2155u/
7. J. Biskup and L. Wiese, On finding an inference-proof complete database for controlled query evaluation, in: 20th Annual IFIP WG 11.3 Conference on Data and Applications Security, Proceedings, E. Damiani and P. Liu, eds, Lecture Notes in Computer Science, Vol. 4127, Springer, Berlin, Germany, 2006, pp. 30-43.
8. L.W. Chang and I.S. Moskowitz, A study of inference problems in distributed databases, in: 16th Annual IFIP WG 11.3 Conference on Data and Applications Security, Proceedings, E. Gudes and S. Shenoi, eds, Kluwer, Dordrecht, The Netherlands, 2002, pp. 191-204.
9. M. Davis, G. Logemann and D.W. Loveland, A machine program for theorem-proving, Communications of the ACM 5(7) (1962), 394-397.
10. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7(3) (1960), 201-215.
11. J. Domingo-Ferrer, ed., Inference Control in Statistical Databases, from Theory to Practice, Lecture Notes in Computer Science, Vol. 2316, Springer, Berlin, Germany, 2002.
12. N. Eén and A. Biere, Effective preprocessing in SAT through variable and clause elimination, in: 8th International Conference on Theory and Applications of Satisfiability Testing, Proceedings, F. Bacchus and T. Walsh, eds, Lecture Notes in Computer Science, Vol. 3569, Springer, Berlin, Germany, 2005, pp. 61 -75.
13. C. Farkas and S. Jajodia, The inference problem: A survey, SIGKDD Explorations 4(2) (2002), 6 -11.
14. M.K. Ganai, P. Ashar, A. Gupta, L. Zhang and S. Malik, Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver, in: 39th Design Automation Conference, Proceedings, ACM, New York, 2002, pp. 747 -750.
15. E. Giunchiglia and R. Sebastiani, Applying the Davis -Putnam procedure to non-clausal formulas, in: 6th Congress of the Italian Association for Artificial Intelligence, Proceedings, E. Lamma and P. Mello, eds, Lecture Notes in Computer Science, Vol. 1792, Springer, Berlin, Germany, 2000, pp. 84 -94.
16. J. Hale and S. Shenoi, Analyzing FD inference in relational databases, Data & Knowledge Engineering 18(2) (1996), 167 -183.
17. F. Heras, J. Larrosa and A. Oliveras, MiniMaxSAT: An efficient weighted Max-SAT solver, Journal of Artificial Intelligence Research 31 (2008), 1 -32.
18. J. Larrosa, F. Heras and S. de Givry, A logical approach to efficient Max-SAT solving, Artificial Intelligence 172(2-3) (2008), 204 -233.
19. S. Subbarayan and D.K. Pradhan, Niver: Non increasing variable elimination resolution for preprocessing SAT instances, in: 7th International Conference on Theory and Applications of Satisfiability Testing, Proceedings, Lecture Notes in Computer Science, Vol. 3542, Springer, Berlin, Germany, 2004, pp. 276 -291.
20. C. Thiffault, F. Bacchus and T. Walsh, Solving non-clausal formulas with DPLL search, in: 7th International Conference on Theory and Applications of Satisfiability Testing, Online Proceedings, Vancouver, BC, Canada, 2004.
21. L. Wang, Y. Li, D. Wijesekera and S. Jajodia, Precisely answering multi-dimensional range queries without privacy breaches, in: 8th European Symposium on Research in Computer Security, Proceedings, E. Snekkenes and D. Gollmann, eds, Lecture Notes in Computer Science, Vol. 2808, Springer, Berlin, Germany, 2003, pp. 100 -115.
22. X. Yang and C. Li, Secure XML publishing without information leakage in the presence of data inference, in: 30th International Conference on Very Large Data Bases, Proceedings, M.A. Nascimento, M. Tamer Özsu, D. Kossmann, R.J. Miller, J.A. Blakeley and K.B. Schiefer, eds, Morgan Kaufmann, San Francisco, CA, 2004, pp. 96 -107.
23. L. Zhang, On subsumption removal and on-the-fly CNF simplification, in: 8th International Conference on Theory and Applications of Satisfiability Testing, Proceedings, F. Bacchus and T. Walsh, eds, Lecture Notes in Computer Science, Vol. 3569, Springer, Berlin, Germany, 2005, pp. 482 -489.
24. L. Zhang and S. Malik, The quest for efficient boolean satisfiability solvers, in: 18th International Conference on Automated Deduction, Proceedings, A. Voronkov, ed., Lecture Notes in Computer Science, Vol. 2392, Springer, Berlin, Germany, 2002, pp. 295 -313.