A sound and complete model-generation procedure for consistent and confidentiality-preserving databases

Theoretical Computer Science

Volumn 412, Issue 31, 2011, Pages 4044-4072

  Biskup, Joachim ^a   Wiese, Lena ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Availability; Confidentiality; Databases; Denial constraints; Herbrand's theorem; Model generation; Privacy; Semantic trees; Weakly acyclic dependencies

Indexed keywords

CONFIDENTIALITY; DENIAL CONSTRAINTS; HERBRAND'S THEOREM; MODEL GENERATION; SEMANTIC TREES; WEAKLY ACYCLIC DEPENDENCIES;

NUMBER THEORY; PLANT EXTRACTS; SEMANTICS; THEOREM PROVING;

DATABASE SYSTEMS;

EID: 79958038774     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.04.026     Document Type: Article

References (59)

1. T.S. Toland, C. Farkas, and C.M. Eastman The inference problem: maintaining maximal availability in the presence of database updates Computers & Security 29 2010 88 103
2. K. Kenthapadi, N. Mishra, and K. Nissim Simulatable auditing Twenty-fourth Symposium on Principles of Database Systems, Proceedings 2005 ACM 118 127 (Pubitemid 43275475)
3. L. Zhang, S. Jajodia, and A. Brodsky Simulatable binding: beyond simulatable auditing 5th VLDB Workshop on Secure Data Management SDM 2008 Lecture Notes in Computer Science vol. 5159 2008 Springer 16 31
4. L. Zhang, A. Brodsky, and S. Jajodia Restoring compromised privacy in micro-data disclosure 5th ACM Symposium on Information, Computer and Communications Security ASIACCS 2010 2010 ACM 36 47
5. V. Ciriani, S.D.C. diVimercati, S. Foresti, S. Jajodia, S. Paraboschi, and P. Samarati Keep a few: outsourcing data while maintaining confidentiality 14th European Symposium on Research in Computer Security ESORICS 2009 Lecture Notes in Computer Science vol. 5789 2009 Springer 440 455
6. S.D.C. di Vimercati, S. Foresti, S. Jajodia, S. Paraboschi, P. Samarati, Fragments and loose associations: respecting privacy in data publishing, in: Proceedings of the VLDB Endowment, 3, 2010, pp. 13701381.
7. K. Stoffel, and T. Studer Provable data privacy 16th International Conference on Database and Expert Systems Applications, DEXA 2005, Proceedings Lecture Notes in Computer Science vol. 3588 2005 Springer 324 332 (Pubitemid 41450467)
8. P. Stouppa, and T. Studer Data privacy for knowledge bases International Symposium on Logical Foundations of Computer Science, Proceedings Lecture Notes in Computer Science vol. 5407 2009 Springer 409 421
9. G. Miklau, and D. Suciu A formal analysis of information disclosure in data exchange Journal of Computer and System Sciences 73 2007 507 534 (Pubitemid 46027076)
10. B. Cuenca Grau, and I. Horrocks Privacy-preserving query answering in logic-based information systems 18th European Conference on Artificial Intelligence Patras, Proceedings Frontiers in Artificial Intelligence and Applications vol. 178 2008 IOS Press 40 44
11. N. Jukic, S. Nestorov, S.V. Vrbsky, and A.S. Parrish Enhancing database access control by facilitating non-key related cover stories Journal of Database Management 16 2005 1 20 (Pubitemid 40851107)
12. R.S. Sandhu, and S. Jajodia Polyinstantation for cover stories 2nd European Symposium on Research in Computer Security ESORICS 92, Proceedings Lecture Notes in Computer Science vol. 648 1992 Springer 307 328
13. D.E. Denning Cryptography and Data Security 1982 Addison-Wesley
14. V. Ciriani, S.D.C. di Vimercati, S. Foresti, and P. Samarati k-anonymity Secure Data Management in Decentralized Systems Advances in Information Security vol. 33 2007 Springer 323 353
15. J. Biskup Usability confinement of server reactions: maintaining inference-proof client views by controlled interaction execution 6th International Workshop of Databases in Networked Information Systems DNIS 2010, Proceedings Lecture Notes in Computer Science vol. 5999 2010 Springer 80 106
16. J. Biskup, and P.A. Bonatti Controlled query evaluation with open queries for a decidable relational submodel Annals of Mathematics and Artificial Intelligence 50 2007 39 77
17. J. Biskup, and P.A. Bonatti Controlled query evaluation for enforcing confidentiality in complete information systems International Journal of Information Security 3 2004 14 27
18. J. Biskup, and P.A. Bonatti Controlled query evaluation for known policies by combining lying and refusal Annals of Mathematics and Artificial Intelligence 40 2004 37 62 (Pubitemid 38103547)
19. J. Biskup, and L. Wiese On finding an inference-proof complete database for controlled query evaluation 20th Conference on Data and Applications Security DBSec06, Proceedings Lecture Notes in Computer Science vol. 4127 2006 Springer 30 43 (Pubitemid 44165877)
20. J. Biskup, and L. Wiese Preprocessing for controlled query evaluation with availability policy Journal of Computer Security 16 2008 477 494
21. J. Biskup, and L. Wiese Combining consistency and confidentiality requirements in first-order databases 12th Information Security Conference Lecture Notes in Computer Science vol. 5735 2009 Springer 121 134
22. A. Van Gelder, and R.W. Topor Safety and translation of relational calculus queries ACM Transactions on Database Systems 16 1991 235 278 (Pubitemid 23600335)
23. A. Cal, D. Lembo, and R. Rosati On the decidability and complexity of query answering over inconsistent and incomplete databases Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Proceedings 2003 ACM 260 271
24. M. Arenas, L.E. Bertossi, and J. Chomicki Answer sets for consistent query answering in inconsistent databases Theory and Practice of Logic Programming 3 2003 393 424
25. M. Arenas, and L.E. Bertossi On the decidability of consistent query answering 4th Alberto Mendelzon International Workshop on Foundations of Data Management, Proceedings CEUR Workshop Proceedings vol. 619 2010
26. M. Dalal Investigations into a theory of knowledge base revision Seventh National Conference on Artificial Intelligence AAAI-88 1988 AAAI Press 475 479
27. E. Brger, E. Grdel, and Y. Gurevich The Classical Decision Problem 2001 Springer
28. R. Hull, and J. Su Domain independence and the relational calculus Acta Informatica 31 1994 513 524
29. F.N. Afrati, and P.G. Kolaitis Repair checking in inconsistent databases: algorithms and complexity 12th International Conference on Database Theory, Proceedings ACM International Conference Proceeding Series vol. 361 2009 ACM 31 41
30. E. Bertino, F. Buccafurri, E. Ferrari, and P. Rullo A logic-based approach for enforcing access control Journal of Computer Security 8 2000 109 139
31. E. Bertino, F. Buccafurri, E. Ferrari, and P. Rullo An authorization model and its formal semantics J.-J. Quisquater, Y. Deswarte, C. Meadows, D. Gollmann, 5th European Symposium on Research in Computer Security, ESORICS98, Proceedings Lecture Notes in Computer Science vol. 1485 1998 Springer 127 142 (Pubitemid 128135769)
32. J. Chomicki Consistent query answering: five easy pieces 11th International Conference on Database Theory, Proceedings Lecture Notes in Computer Science vol. 4353 2007 Springer 1 17
33. R. Fagin, P.G. Kolaitis, R.J. Miller, and L. Popa Data exchange: semantics and query answering Theoretical Computer Science 336 2005 89 124 (Pubitemid 40612385)
34. J. Chomicki, and J. Marcinkowski On the computational complexity of minimal-change integrity maintenance in relational databases Inconsistency Tolerance Lecture Notes in Computer Science vol. 3300 2005 Springer 119 150
35. R. Hull, and J. Su On the expressive power of database queries with intermediate types Journal of Computer and System Sciences 43 1991 219 267 (Pubitemid 21680391)
36. J.A. Robinson A machine-oriented logic based on the resolution principle Journal of the ACM 12 1965 23 41
37. C.-L. Chang, and R.C.-T. Lee Symbolic Logic and Mechanical Theorem Proving 1973 Academic Press
38. M. Fitting First-order Logic and Automated Theorem Proving 1996 Springer
39. A. Galinovic, and V. Antoncic Polyinstantiation in relational databases with multilevel security 29th International Conference on Information Technology Interfaces, Proceedings 2007 IEEE 127 132
40. F. Cuppens, and A. Gabillon Cover story management Data & Knowledge Engineering 37 2001 177 201 (Pubitemid 32287853)
41. F. Bry, and S. Torge A deduction method complete for refutation and finite satisfiability JELIA Logics in Artificial Intelligence, Proceedings Lecture Notes in Computer Science vol. 1489 1998 Springer 122 138 (Pubitemid 128151707)
42. P. Baumgartner FDPLL a first order Davis-Putnam-Logeman-Loveland procedure 17th International Conference on Automated Deduction, Proceedings Lecture Notes in Computer Science vol. 1831 2000 Springer 200 219
43. P. Baumgartner, and C. Tinelli The model evolution calculus with equality 20th International Conference on Automated Deduction, Proceedings Lecture Notes in Computer Science vol. 3632 2005 Springer 392 408
44. P. Baumgartner, and C. Tinelli The model evolution calculus as a first-order DPLL method Artificial Intelligence 172 2008 591 632
45. F.N. Afrati, and P.G. Kolaitis Answering aggregate queries in data exchange M. Lenzerini, D. Lembo, Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Proceedings 2008 ACM 129 138
46. M. Arenas, L.E. Bertossi, and M. Kifer Applications of annotated predicate calculus to querying inconsistent databases First International Conference on Computational Logic, Proceedings Lecture Notes in Computer Science vol. 1861 2000 Springer 926 941
47. L. Bravo, and L.E. Bertossi Logic programs for consistently querying data integration systems Eighteenth International Joint Conference on Artificial Intelligence, Proceedings 2003 Morgan Kaufmann 10 15
48. J. Wijsen Database repairing using updates ACM Transactions on Database Systems 30 2005 722 768 (Pubitemid 43906382)
49. A. Lopatenko, and L.E. Bertossi Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics 11th International Conference on Database Theory, Proceedings Lecture Notes in Computer Science vol. 4353 2007 Springer 179 193
50. L.E. Bertossi, L. Bravo, E. Franconi, and A. Lopatenko The complexity and approximation of fixing numerical attributes in databases under integrity constraints Information Systems 33 2008 407 434
51. L.E. Bertossi Database repair Encyclopedia of Database Systems 2009 Springer 722 723
52. S. Staworko, and J. Chomicki Consistent query answers in the presence of universal constraints Information Systems 35 2010 1 22
53. M. Caniupn Marileo, and L.E. Bertossi The consistency extractor system: answer set programs for consistent query answering in databases Data & Knowledge Engineering 69 2010 545 572
54. D. Makinson How to give it up: a survey of some formal aspects of the logic of theory change Synthese 62 1985 347 363
55. H. Katsuno, and A.O. Mendelzon On the difference between updating a knowledge base and revising it Second International Conference on Principles of Knowledge Representation and Reasoning KR'91, Proceedings 1991 Morgan Kaufmann Publishers 387 394
56. A. Herzig, and O. Rifi Propositional belief base update and minimal change Artificial Intelligence 115 1999 107 138 (Pubitemid 30522973)
57. S. Chou, and M. Winslett A model-based belief revision system Journal of Automated Reasoning 12 1994 157 208
58. M.-A. Williams Anytime belief revision Fifteenth International Joint Conference on Artificial Intelligence, Proceedings 1997 Morgan Kaufmann 74 81
59. C. Tadros, and L. Wiese Using SAT solvers to compute inference-proof database instances 4th International Workshop on Data Privacy Management and Second International Workshop on Autonomous Spontaneous Security, Revised Selected Papers Lecture Notes in Computer Science vol. 5939 2009 Springer 65 77