The role graph model and conflict of interest
Authors:
Open Access
- 1 February 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information and System Security
- Vol. 2 (1) , 3-33
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.Keywords
This publication has 12 references indexed in Scilit:
- Modeling users in role-based access control2000
- Role hierarchies and constraints for lattice-based access controls1996
- Role-based access control modelsComputer, 1996
- The management of computer security profiles using a role-oriented approachComputers & Security, 1994
- Design for dynamic user-role-based securityComputers & Security, 1994
- Role-based security, object oriented databases and separation of dutyACM SIGMOD Record, 1993
- A model of authorization for next-generation database systemsACM Transactions on Database Systems, 1991
- Naming and grouping privileges to simplify security management in large databases1990
- Protection in operating systemsCommunications of the ACM, 1976
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972