Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Algebra and logic for access control
Collinson M., Pym D. Formal Aspects of Computing22 (2):83-104,2010.Type:Article
Date Reviewed: Aug 25 2010

Access control is ubiquitous to the extent that we hardly perceive its presence in our activities--from who we give our house keys to, to who can authorize the publication of article reviews on a Web site. In light of this, the relative paucity of logical frameworks for reasoning about access controls is perhaps quite surprising.

Collinson and Pym propose one such logical framework for modeling and reasoning about access control. Compared to earlier efforts, which focused on just a logic, the focus of this work is on the joint development of an operational model and a logic for access control. The operational model is based on the SCRP calculus that delineates the passive notion of a resource from that of an active process. The logic is based on a variant of the logic of bunched implications. The surprising fact is that this entire framework is highly coherent, as demonstrated by a Hennessy-Milner-style equivalence between the logic and the calculus.

The paper builds on the authors’ earlier work on the calculus (SCRP) and the logic (MBI) of resources and processes. The important notion of a role is modeled by introducing a process connective into the calculus, and the “says” modality in the modal logic. This notion of a role is inspired from an earlier similar notion [1]. There seem to be some differences between the two notions, but the authors do not dwell on these differences.

The bulk of the paper is given over to examples of how the theoretical framework can be used to reason about access control decisions. A number of scenarios are studied and modeled, starting with very simple resource models and culminating in a sophisticated example where the resource component models the beliefs of the various entities in the scenario considered. These examples clearly bring out the significance of the work, providing both an assembly language for performing access control and an associated logic for reasoning about the access control actions.

Reviewer:  Prahladavaradan Sampath Review #: CR138329 (1101-0078)
1) Abadi, M.; Burrows, M.; Lampson, B.; Plotkin, G. A calculus for access control in distributed systems. ACM Transactions on Programming Languages and Systems 15, 4(1993), 706–734.
Bookmark and Share
 
Modal Logic (F.4.1 ... )
 
 
Modeling Methodologies (I.6.5 ... )
 
 
Process Control Systems (C.3 ... )
 
 
Security (K.6.m ... )
 
 
Models Of Computation (F.1.1 )
 
 
Security and Protection (K.6.5 )
 
Would you recommend this review?
yes
no
Other reviews under "Modal Logic": Date
A class of decidable information logics
Demri S. Theoretical Computer Science 195(1): 33-60, 1998. Type: Article
Jul 1 1998
First-order modal logic
Fitting M., Mendelsohn R., Kluwer Academic Publishers, Norwell, MA, 1999. Type: Book (9780792353348)
Mar 1 2000
Modal logic
Blackburn P. (ed), de Rijke M. (ed), Venema Y. (ed), Cambridge University Press, New York, NY, 2001.  554, Type: Book (9780521802000), Reviews: (1 of 2)
May 31 2002
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud, Inc.®
Terms of Use
| Privacy Policy