We present a logic for specifying policies where access requests can have effects on the authorization state. The logic is semantically defined by a mapping to Transaction Logic. Using this approach, updates to the state are factored out of the resource guard, thus enhancing maintainability and facilitating more expressive policies that take the history of access requests into account. We also present a sound and complete proof system for reasoning about sequences of access requests. This gives rise to a goal-oriented algorithm for finding minimal sequences that lead to a specified target authorization state. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Becker, M. Y., & Nanz, S. (2007). A logic for state-modifying authorization policies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4734 LNCS, pp. 203–218). Springer Verlag. https://doi.org/10.1007/978-3-540-74835-9_14
Mendeley helps you to discover research relevant for your work.