Secure Deductive Databases

  • Steve Barker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1990)


We show how deductive databases may be protected against unauthorized retrieval and update requests issued by authenticated users. To achieve this protection, a deductive database is expressed in an equivalent form that is guaranteed to permit only authorized actions. When a user poses a query Q on the protected form of a database, the user sees the subset of the answers for Q that they are permitted to know are true in the database; when a user’s update request is received, a minimal set of authorized changes the user is permitted to make to the database is performed. The authorized retrieval and update requests are specified using a security theory that is expressed in normal clause logic. The approach has a number of attractive technical results associated with it, and can be used to protect the information in any deductive database that is expressed in normal clause logic.


Security Policy Access Request Change Request Ground Instance Deductive Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abiteboul, S., Hull, R., and Vianu, V., Foundations of Databases, Addison-Wesley, 1995.Google Scholar
  2. 2.
    Apt, K., and Bezem, M., Acyclic Programs, New Generation Computing, 1990.Google Scholar
  3. 3.
    Barker, S., Security Policy Specification in Logic, ICAI’2000, 2000.Google Scholar
  4. 4.
    Barker, S., Data Protection by Logic Programming, 1st International Conference on Computational Logic, LNAI 1861, Springer, 2000.Google Scholar
  5. 5.
    Barker, S., TRBACN: A Temporal Authorization Model, To Appear.Google Scholar
  6. 6.
    Bonatti, P., Kraus, S., and Subrahmanian, V., Foundations of Secure Deductive Databases, IEEE Transactions on Knowledge and Data Engineering,7, 3, 1995.Google Scholar
  7. 7.
    Brass, S., SLDMagic-The Real Magic (With Applications to Web Queries), 1st International Conference on Computational Logic, LNAI 1861, Springer, 2000.Google Scholar
  8. 8.
    Castano, S., Fugini, M., Martella, G., and Samarati, P., Database Security, Addison-Wesley, 1995.Google Scholar
  9. 9.
    Chen, W., and Warren, D., Tabled Evaluation with Delaying for General Logic Programs, J. ACM, 43(1), 1996.Google Scholar
  10. 10.
    Clark, K., Negation as Failure, in H Gallaire and J. Minker(Eds), Logic and Databases, Plenum, NY, 1978.Google Scholar
  11. 11.
    Cuppens, F., and Demolombe, R., A Modal Logical Framework for Security Policies, ISMIS’97, 1997.Google Scholar
  12. 12.
    Decker, H., and Celma, M., A Slick Procedure for Integrity Checking in Deductive Databases, ICLP, 1994.Google Scholar
  13. 13.
    Ferraiolo, D., Cugini, J., and Kuhn, R., Role-Based Access Control (RBAC): Features and Motivations, Proc. of the Annual Computer Security Applications Conf., IEEE Computer Science Press, 1995.Google Scholar
  14. 14.
    Jajodia, S., Samarati, P., and Subrahmanian, V., A Logical Language for Expressing Authorizations, Proc. IEEE Symp. on Security and Privacy, 1997.Google Scholar
  15. 15.
    Jamil, H., Belief Reasoning in MLS Deductive Databases, ACM SIGMOD’99, 1999.Google Scholar
  16. 16.
    LLoyd, J., Foundations of Logic Programming, Springer, 1987.Google Scholar
  17. 17.
    Minker, J., Logic and Databases: A 20 Year Retrospective, 1st International Workshop on Logic in Databases, LNCS 1154, Springer, 1996.Google Scholar
  18. 18.
    Przymusinski, T., Perfect Model Semantics, Proc. 5th ICLP, 1988.Google Scholar
  19. 19.
    Sandhu, R., Coyne, E., Feinstein, H., and Youman, C., Role-Based Access Control Models, IEEE Computer, 1996.Google Scholar
  20. 20.
    Sagonas, K., Swift, T., Warren, D., Freire, J., Rao, P., The XSB System, Version 2.0, Programmer’s Manual, 1999.Google Scholar
  21. 21.
    VanGelder, A., Ross, K., and Schlipf, J., The Well-Founded Semantics for General Logic Programs, J. ACM, 38(3), 1991.Google Scholar
  22. 22.
    Vardi, M., The Complexity of Query Languages, ACM Symp. on the Theory of Computing, May, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Steve Barker
    • 1
  1. 1.CSCSUniversity of WestminsterLondonUK

Personalised recommendations