On finding an inference-proof complete database for controlled query evaluation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4127 LNCS, Issue , 2006, Pages 30-43

  Biskup, Joachim ^a   Wiese, Lena ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Branch and Bound; Complete database systems; Confidentiality of data; Controlled Query Evaluation; Inference control; Lying; Prepositional logic; SAT solving

Indexed keywords

INFERENCE ENGINES; QUERY LANGUAGES; SECURITY OF DATA; SEMANTICS; THEOREM PROVING; USER INTERFACES; BRANCH AND BOUND METHOD; DATABASE SYSTEMS; FORMAL LOGIC; QUERY PROCESSING;

BRANCH AND BOUND; COMPLETE DATABASE SYSTEMS; CONFIDENTIALITY OF DATA; CONTROLLED QUERY EVALUATION; INFERENCE CONTROL; LYING; PREPOSITIONAL LOGIC; SAT SOLVING; PROPOSITIONAL LOGIC; QUERY EVALUATION; SAT-SOLVING;

DATABASE SYSTEMS; SEARCH ENGINES;

EID: 33746679253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805588_3     Document Type: Conference Paper

References (21)

1. Joachim Biskup and Piero A. Bonatti. Lying versus refusal for known potential secrets. Data & Knowledge Engineering, 38(2): 199-222, 2001.
2. Joachim Biskup and Piero A. Bonatti. Controlled query evaluation for enforcing confidentiality in complete information systems. International Journal of Information Security, 3(1):14-27, 2004.
3. Joachim Biskup and Piero A. Bonatti. Controlled query evaluation for known policies by combining lying and refusal. Annals of Mathematics and Artificial Intelligence, 40(1-2).-37-62, 2004.
4. Joachim Biskup and Torben Weibert. Refusal in incomplete databases. In Csilla Parkas and Pierangela Samarati, editors, 18th Annual IFIP WG 11.3 Conference on Data and Applications Security, Proceedings, pages 143-157. Kluwer, 2004.
5. LiWu Chang and Ira S. Moskowitz. A study of inference problems in distributed databases. In Ehud Gudes and Sujeet Shenoi, editors, 16th Annual IFIP WG 11.3 Conference on Data and Applications Security, Proceedings, pages 191-204. Kluwer, 2002.
6. Martin Davis, George Logemann, and Donald W. Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, 1962.
7. Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960.
8. James P. Delgrande and Torsten Schaub. Two approaches to merging knowledge bases. In José Júlio Alferes and João Alexandre Leite, editors, 9th European Conference on Logics in Artificial Intelligence, Proceedings, volume 3229 of Lecture Notes in Computer Science, pages 426-438. Springer, 2004.
9. Josep Domingo-Ferrer, editor. Inference Control in Statistical Databases, From Theory to Practice, volume 2316 of Lecture Notes in Computer Science. Springer, 2002.
10. Niklas Eén and Armin Biere. Effective preprocessing in SAT through variable and clause elimination. In Fahiem Bacchus and Toby Walsh, editors, 8th International Conference on Theory and Applications of Satisfiability Testing, Proceedings, volume 3569 of Lecture Notes in Computer Science, pages 61-75. Springer, 2005.
11. Csilla Farkas and Sushil Jajodia. The inference problem: A survey. SIGKDD Explorations, 4(2):6-11, 2002.
12. Thom Frühwirth and Slim Abdennadher. Essentials of Constraint Programming. Springer, 2003.
13. Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao Zhang, and Sharad Malik. Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. In 39th Design Automation Conference, Proceedings, pages 747-750. ACM, 2002.
14. Enrico Giunchiglia and Roberto Sebastiani. Applying the Davis-Putnam procedure to non-clausal formulas. In Evelina Lamma and Paola Mello, editors, 6th Congress of the Italian Association for Artificial Intelligence, Proceedings, volume 1792 of Lecture Notes in Computer Science, pages 84-94. Springer, 2000.
15. John Hale and Sujeet Shenoi. Analyzing fd inference in relational databases. Data & Knowledge Engineering, 18(2):167-183, 1996.
16. Sathiamoorthy Subbarayan and Dhiraj K. Pradhan. Niver: Non increasing variable elimination resolution for preprocessing SAT instances. In 7th International Conference on Theory and Applications of Satisfiability Testing, Online Proceedings, 2004.
17. Christian Thiffault, Fahiem Bacchus, and Toby Walsh. Solving non-clausal formulas with DPLL search. In 7th International Conference on Theory and Applications of Satisfiability Testing, Online Proceedings, 2004.
18. Lingyu Wang, Yingjiu Li, Duminda Wijesekera, and Sushil Jajodia. Precisely answering multi-dimensional range queries without privacy breaches. In Einar Snekkenes and Dieter Gollmann, editors, 8th European Symposium on Research in Computer Security, Proceedings, volume 2808 of Lecture Notes in Computer Science, pages 100-115. Springer, 2003.
19. Xiaochun Yang and Chen Li. Secure XML publishing without information leakage in the presence of data inference. In Mario A. Nascimento, M. Tamer Özsu, Donald Kossmann, Renée J. Miller, José A. Blakeley, and K. Bernhard Schiefer, editors, 30th International Conference on Very Large Data Bases, Proceedings, pages 96-107. Morgan Kaufmann, 2004.
20. Lintao Zhang. On subsumption removal and on-the-fly CNF simplification. In Fahiem Bacchus and Toby Walsh, editors, 8th International Conference on Theory and Applications of Satisfiability Testing, Proceedings, volume 3569 of Lecture Notes in Computer Science, pages 482-489. Springer, 2005.
21. Lintao Zhang and Sharad Malik. The quest for efficient boolean satisfiability solvers. In Andrei Voronkov, editor, 18th International Conference on Automated Deduction, Proceedings, volume 2392 of Lecture Notes in Computer Science, pages 295-313. Springer, 2002.