Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Practical Aspects of Declarative Languages

PADL 2001: Practical Aspects of Declarative Languages pp 123–137Cite as

Secure Deductive Databases

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1990))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., and Vianu, V., Foundations of Databases, Addison-Wesley, 1995.

    Google Scholar 

  2. Apt, K., and Bezem, M., Acyclic Programs, New Generation Computing, 1990.

    Google Scholar 

  3. Barker, S., Security Policy Specification in Logic, ICAI’2000, 2000.

    Google Scholar 

  4. Barker, S., Data Protection by Logic Programming, 1st International Conference on Computational Logic, LNAI 1861, Springer, 2000.

    Google Scholar 

  5. Barker, S., TRBACN: A Temporal Authorization Model, To Appear.

    Google Scholar 

  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. Brass, S., SLDMagic-The Real Magic (With Applications to Web Queries), 1st International Conference on Computational Logic, LNAI 1861, Springer, 2000.

    Google Scholar 

  8. Castano, S., Fugini, M., Martella, G., and Samarati, P., Database Security, Addison-Wesley, 1995.

    Google Scholar 

  9. Chen, W., and Warren, D., Tabled Evaluation with Delaying for General Logic Programs, J. ACM, 43(1), 1996.

    Google Scholar 

  10. Clark, K., Negation as Failure, in H Gallaire and J. Minker(Eds), Logic and Databases, Plenum, NY, 1978.

    Google Scholar 

  11. Cuppens, F., and Demolombe, R., A Modal Logical Framework for Security Policies, ISMIS’97, 1997.

    Google Scholar 

  12. Decker, H., and Celma, M., A Slick Procedure for Integrity Checking in Deductive Databases, ICLP, 1994.

    Google Scholar 

  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. Jajodia, S., Samarati, P., and Subrahmanian, V., A Logical Language for Expressing Authorizations, Proc. IEEE Symp. on Security and Privacy, 1997.

    Google Scholar 

  15. Jamil, H., Belief Reasoning in MLS Deductive Databases, ACM SIGMOD’99, 1999.

    Google Scholar 

  16. LLoyd, J., Foundations of Logic Programming, Springer, 1987.

    Google Scholar 

  17. Minker, J., Logic and Databases: A 20 Year Retrospective, 1st International Workshop on Logic in Databases, LNCS 1154, Springer, 1996.

    Google Scholar 

  18. Przymusinski, T., Perfect Model Semantics, Proc. 5th ICLP, 1988.

    Google Scholar 

  19. Sandhu, R., Coyne, E., Feinstein, H., and Youman, C., Role-Based Access Control Models, IEEE Computer, 1996.

    Google Scholar 

  20. Sagonas, K., Swift, T., Warren, D., Freire, J., Rao, P., The XSB System, Version 2.0, Programmer’s Manual, 1999.

    Google Scholar 

  21. VanGelder, A., Ross, K., and Schlipf, J., The Well-Founded Semantics for General Logic Programs, J. ACM, 38(3), 1991.

    Google Scholar 

  22. Vardi, M., The Complexity of Query Languages, ACM Symp. on the Theory of Computing, May, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CSCS, University of Westminster, W1W 6UW, London, UK

    Steve Barker

Authors
  1. Steve Barker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, State University of New York, Stony Brook, 11794, NY, USA

    I. V. Ramakrishnan

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barker, S. (2001). Secure Deductive Databases. In: Ramakrishnan, I.V. (eds) Practical Aspects of Declarative Languages. PADL 2001. Lecture Notes in Computer Science, vol 1990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45241-9_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45241-9_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41768-2

  • Online ISBN: 978-3-540-45241-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation