Abstract
We show how the family of temporal role-based access control (TRBAC) models from [6], the TRBACO models, may be equivalently represented in a considerably simpler and more efficiently implemented way. We call the latter the TRBACN models. To specify TRBACN models, stratified normal clause logic is sufficient. To compute with TRBACN models, any procedural semantics that enables the perfect model of a stratified theory to be generated may be used. Although TRBACN security models have a much simpler representation than TRBACO models, we show that TRBACN and TRBACO models are equivalent in terms of their expressive power.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Hull, R., and Vianu, V.: Foundations of Databases. Addison-Wesley (1995)
Apt, K., Blair, H., and Walker, A.: Towards a Theory of Declarative Knowledge. In Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan-Kaufmann Publishers (1988)
Apt, K., and Bezem, M.: Acyclic Programs. New Generation Computing (1990)
Apt., K., and Pedreschi., D.: Reasoning about Termination of Pure Prolog Programs. Information and Computation, 106 (1993)
Barker, S.: Temporal Authorization in the Simplified Event Calculus. In Atluri V., and Hale, J., Hale J. (eds): Research Advances in Database and Information Systems Security. Kluwer Academic Publishers (2000)
Barker, S.: Data Protection by Logic Programming, 1st International Conference on Computational Logic, LNAI 1861, Springer-Verlag (2000)
Barker, S.: Secure Deductive Databases. PADL’01 (2001)
Bertino, E., Bettini, C., Ferrari, E., and Samarati, P.: A Temporal Access Control Mechanism for Database Systems. IEEE TKDE, 8(1) (1996)
Bertino, E., Bettini, C., Ferrari, E., and Samarati, P.: An Access Control Model Supporting Periodicity Constraints and Temporal Reasoning. TODS, 23(3) (1998)
Castano, S., Fugini, M., Martella, G., and Samarati, P.: Database Security, Addison Wesley. (1995)
Chen, W., Swift, T., and Warren, D.: Efficient Top-Down Computation of Queries Under the Well-Founded Semantics. JLP, 24(3) (1995)
Clark, K.: Negation as Failure. In H. Gallaire and J. Minker (eds): Logic and Databases. Plenum (1978)
Ferraiolo, D., Cugini, J., and Kuhn, R.: Role-Based Access Control: Features and Motivations. Proc. 11th Annual Computer Security Applications Conf., (1995)
Ferraiolo, D., Gilbert, D., and Lynch, N.: An Examination of Federal and Commercial Access Control Policy Needs. Proc. NIST-NCSC National Security Conf. (1993)
Lloyd, J.: Foundations of Logic Programming, 2nd Ed., Springer (1987)
Przymusinski, T.: Perfect Model Semantics. Proc. 5th ICLP, (1988)
Sandhu, R., Coyne, E., Feinstein, H., and Youman, C.: Role-Based Access Control Models. IEEE Computer, (1996)
Sandhu, R., Coyne, E., Feinstein, H., and Youman, C.: Role-Based Access Control: A Multi-Dimensional View. Proc. 10th Annual Computer Security Applications Conf. (1994)
Thomas, R., and Sandhu, R.: Discretionary Access Control in Object-Oriented Databases: Issues and Research Directions, Proc. 16th National Computer Security Conf. (1993)
Van Gelder, A.: Negation as Failure Using Tight Derivations for General Logic Programs. In Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan-Kaufmann Publishers (1988)
Van Gelder, A., Ross, K., and Schlipf, J.: The Well-Founded Semantics for General Logic Programs. J. ACM, 383) (1991)
Vardi, M.: The Complexity of Query Languages. ACM Symp. on the Theory of Computing (May, 1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barker, S. (2001). TRBACN: A Temporal Authorization Model. In: Gorodetski, V.I., Skormin, V.A., Popyack, L.J. (eds) Information Assurance in Computer Networks. MMM-ACNS 2001. Lecture Notes in Computer Science, vol 2052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45116-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-45116-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42103-0
Online ISBN: 978-3-540-45116-7
eBook Packages: Springer Book Archive