Abstract
In [1], we proposed a formal approach to specify authorization policies and their transformations. In this paper, we discuss the implementation issues of this approach and analyse the complexities of the algorithms introduced.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Y. Bai and V. Varadharajan, A Model Based Semantics for Transformations of Authorization Policies. Proceedings of 20th Australiasian Computer Science Conference, pp 383–391, Sydney, 1997.
T.S-C. Chou, M. Winslett, Immortal: a Model-based Belief Revision System, The 2nd International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufman Publishers Inc., pp 99–110, 1991.
S.K. Das, Deductive Databases and Logic Programming, Addison-Wesley Publishing Company, UK, 1992.
W.W. McCune, Automated Discovery of New Axiomatizations of the Left Group and Right Group Calculi, Journal of Automated Reasoning. 09(1): pp 1–24, 1992.
S. Russell and P. Norrig, Artificial Intelligence — A Modern Approach. Prentice Hall, 1995.
M. Winslett, Updating Logical Databases. Cambridge University Press, New York, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bai, Y., Varadharajan, V. (1997). Analysis and implementation of a formal authorization policy design approach. In: Varadharajan, V., Pieprzyk, J., Mu, Y. (eds) Information Security and Privacy. ACISP 1997. Lecture Notes in Computer Science, vol 1270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027939
Download citation
DOI: https://doi.org/10.1007/BFb0027939
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63232-0
Online ISBN: 978-3-540-69237-9
eBook Packages: Springer Book Archive