ACM Home Page
Please provide us with feedback. Feedback
The role graph model and conflict of interest
Full text PdfPdf (218 KB)
Source ACM Transactions on Information and System Security (TISSEC) archive
Volume 2 ,  Issue 1  (February 1999) table of contents
Special issue on role-based access control
Pages: 3 - 33  
Year of Publication: 1999
ISSN:1094-9224
Authors
Matunda Nyanchama  Univ. of Western Ontario, Mississauga, Ont., Canada
Sylvia Osborn  Univ. of Western Ontario, Mississauga, Ont., Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 121,   Citation Count: 65
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/300830.300832
What is a DOI?

ABSTRACT

We describe in more detail than before the reference model for role-based access control introduced by Nyanchama and Osborn, and the role-graph model with its accompanying algorithms, which is one way of implementing role-role relationships. An alternative role insertion algorithm is added, and it is shown how the role creation policies of Fernandez et al. correspond to role addition algorithms in our model. We then use our reference model to provide a taxonomy for kinds of conflict. We then go on to consider in some detail privilege-privilege and and role-role conflicts in conjunction with the role graph model. We show how role-role conflicts lead to a partitioning of the role graph into nonconflicting collections that can together be safely authorized to a given user. Finally, in an appendix, we present the role graph algorithms with additional logic to disallow roles that contain conflicting privileges.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
AHO, A. V., GAREY, M. R., AND ULLMAN, J. D. 1972. The transitive reduction of a directed graph. SIAM J. Comput. 1, 2 (June), 131-137.
 
2
BALDWIN, R. 1990. Naming and grouping privileges to simplify security management in large databases. In Proceedings of the IEEE Symposium on Research in Security and Privacy (Oakland, CA). IEEE Computer Society Press, Los Alamitos, CA, 116-132.
3
 
4
 
5
 
6
FERRAIOLO, D., CUGINI, g., AND KUHN, D. R. 1995. Role based access control: Features and motivations. In Proceedings of the 11th Annual Conference on Computer Security Applications. IEEE Computer Society Press, Los Alamitos, CA, 241-248.
7
 
8
9
 
10
 
11
 
12
13
 
14
 
15
16
 
17
18
 
19
 
20
 
21
SANDHU, R. S. 1988. Transaction control expressions for separation of duties. In Proceedings of the 4th Annual Conference on Computer Security Application (Orlando, FL, Dec.). 282-286.
 
22
 
23
 
24
THOMSEN, D. 1991. Role-based application design and enforcement. In Database Security IV, Status and Prospects, S. Jajodia and C. Landwehr, Eds. Elsevier North-Holland, Inc., New York, NY, 151-168.
 
25
 
26
 
27

CITED BY  65


REVIEW

"Jonathan K. Millen : Reviewer"

A role graph is a straightforward, economical presentation of policies for the assignment of data access privileges to users in an enterprise. A role is just a set of privileges, and a privilege represents some particular mode of a  more...

Collaborative Colleagues:
Matunda Nyanchama: colleagues
Sylvia Osborn: colleagues