Abstract
Graph Transformations provide a uniform and precise framework for the specification of access control policies allowing the detailed comparison of different policy models and the precise description of the evolution of a policy. Furthermore, the framework is used for an accurate analysis of the interaction between policies and of the behavior of their integration with respect to the problem of conflicting rules. The integration of policies is illustrated using the Discretionary Access Control and the Lattice Based Access Control policies.
partially supported by the EC under TMR Network GETGRATS and under Esprit WG APPLIGRAPH, and by the Italian MURST.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
P. Bonatti, S. De Capitani di Vimercati, and P. Samarati. A modular approach to composing access control policies. In Proc. of the 7th ACM Conference on Computer and Communication Security. ACM, November 2000.
A. Corradini, H. Ehrig, M. Lowe, and J. Padberg. The category of typed graph grammars and their adjunction with categories of derivations. In 5th Int. Workshop on Graph Grammars and their Application to Computer Science, number 1073 in LNCS, pages 56–74. Springer, 1996.
H. Ehrig, R. Heckel, M. Korff, M. Lowe, L. Ribeiro, A. Wagner, and A. Corradini. Handbook of Graph Grammars and Computing by Graph Transformations. Vol. I: Foundations, chapter Algebraic Approaches to Graph Transformation Part II: Single Pushout Approach and Comparison with Double Pushout Approach. In Rozenberg [Roz97], 1997.
M. Große-Rhode, F. Parisi-Presicce, and M. Simeoni. Spatial and Temporal Refinement of Typed Graph Transformation Systems. In Proc. of MFCS’98, number 1450 in LNCS, pages 553–561. Springer, 1998.
R. Heckel and A. Wagner. Ensuring consistency of conditional graph grammars-a constructive approach. In Proc. SEGRAGRA’95 Graph Rewriting and Computation, number 2. Electronic Notes of TCS, 1995. http://www.elsevier.nl/locate/entcs/volume2.html.
M. Koch, L. V. Mancini, and F. Parisi-Presicce. On the specification and evolution of access control policies. Technical Report SI-2000/05, Dip.Scienze dell’Informazione, Uni. Roma La Sapienza, May 2000.
M. Koch, L.V. Mancini, and F. Parisi-Presicce. A Formal Model for Role-Based Access Control using Graph Transformation. In F. Cuppens, Y. Deswarte, D. Gollmann, and M. Waidner, editors, Proc. of the 6th European Symposium on Research in Computer Security (ESORICS 2000), number 1895 in LNCS, pages 122–139. Springer, 2000.
F. Parisi-Presicce, H. Ehrig, and U. Montanari. Graph Rewriting with unification and composition. In H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors, Int. Workshop on Graph Grammars and their Application to Computer Science, number 291 in LNCS, pages 496–524. Springer, 1987.
G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformations. Vol. I: Foundations. World Scientific, 1997.
R. S. Sandhu. Lattice-based access control models. IEEE Computer, 26(11):9–19, 1993.
R. S. Sandhu. Role-Based Access Control. In Advances in Computers, volume 46. Academic Press, 1998.
R.S. Sandhu and P. Samarati. Access Control: Principles and Practice. IEEE Communication Magazine, pages 40–48, 1994.
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
Koch, M., Mancini, L.V., Parisi-Presicce, F. (2001). Foundations for a Graph-Based Approach to the Specification of Access Control Policies. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_19
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive