Combining consistency and confidentiality requirements in first-order databases

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

Volumn 5735 LNCS, Issue , 2009, Pages 121-134

  Biskup, Joachim ^a   Wiese, Lena ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROCEDURES; DATABASE ENTRY; FIRST-ORDER; GENERAL CLASS; SECURITY POLICY;

DATABASE SYSTEMS;

EID: 70350414506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04474-8_10     Document Type: Conference Paper

References (19)

1. Galinovic, A., Antoncic, V.: Polyinstantiation in relational databases with multilevel security. In: Proceedings of 29th International Conference on Information Technology Interfaces, pp. 127-132. IEEE, Los Alamitos (2007)
2. Jukic, N., Nestorov, S., Vrbsky, S.V., Parrish, A.S.: Enhancing database access control by facilitating non-key related cover stories. Journal of Database Management 16(3), 1-20 (2005)
3. Cuppens, F., Gabillon, A.: Cover story management. Data & Knowledge Engineering 37(2), 177-201 (2001)
4. Sandhu, R.S., Jajodia, S.: Polyinstantation for cover stories. In: Second ESOPJCS. In: Deswarte, Y., Quisquater, J.-J., Eizenberg, G. (eds.) ESORICS 1992. LNCS, vol. 648, pp. 307-328. Springer, Heidelberg (1992)
5. Smith, K., Winslett, M.: Entity modeling in the MLS relational model. In: Proceedings of 18th International Conference on Very Large Data Bases, pp. 199-210. Morgan Kaufmann, San Francisco (1992)
6. Stouppa, P., Studer, T.: Data privacy for knowledge bases. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 409-421. Springer, Heidelberg (2009)
7. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theoretical Computer Science 336(1), 89-124 (2005)
8. Chomicki, J.: Consistent query answering: Five easy pieces. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 1-17. Springer, Heidelberg (2006)
9. Biskup, J., Wiese, L.: Preprocessing for controlled query evaluation with availability policy. Journal of Computer Security 16(4), 477-494 (2008)
10. Biskup, J., Bonatti, P.A.: Controlled query evaluation with open queries for a decid-able relational submodel. Annals of Mathematics and Artificial Intelligence 50(1-2), 39-77 (2007)
11. Winslett, M.: Updating Logical Databases. Cambridge University Press, Cambridge (1990)
12. Borger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (2001)
13. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)
14. Van Gelder, A., Topor, R.W.: Safety and translation of relational calculus queries. ACM Transactions on Database Systems 16, 235-278 (1991)
15. Biskup, J., Burgard, D.M., Weibert, T., Wiese, L.: Inference control in logic databases as a constraint satisfaction problem. In: McDaniel, P., Gupta, S.K. (eds.) ICISS 2007. LNCS, vol. 4812, pp. 128-142. Springer, Heidelberg (2007)
16. Tadros, C., Wiese, L.: Using SAT solvers to compute inference-proof database instances (submitted, 2009)
17. Chang, C.L., Lee, R.C.T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973)
18. Hull, R., Su, J.: Domain independence and the relational calculus. Acta Informat-ica31(6), 513-524 (1994)
19. Ciriani, V., De Capitani di Vimercati, S., Foresti, S., Jajodia, S., Paraboschi, S., Samarati, P.: Fragmentation and encryption to enforce privacy in data storage. In: Biskup, J., López, J. (eds.) ESORICS 2007. LNCS, vol. 4734, pp. 171-186. Springer, Heidelberg (2007)