DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/10911
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRoy, Arindam-
dc.date.accessioned2023-05-18T05:25:59Z-
dc.date.available2023-05-18T05:25:59Z-
dc.date.issued2015-12-
dc.identifier.urihttps://link.springer.com/chapter/10.1007/978-3-319-26961-0_7-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10911-
dc.description.abstractIn recent years, Role Based Access Control (RBAC) has emerged as the most popular access control mechanism, especially for commercial applications. In RBAC, permissions are assigned to roles, which are then assigned to users. The key to the effectiveness of RBAC is the underlying role set that is used. The process of identifying an appropriate set of roles that optimally meets the organizational requirements is called role mining. One of the most useful constraints that can be expressed in RBAC is Separation of Duty (SoD). SoD constraints allow organizations to put a restriction on the minimum number of users required to complete a critical task. However, existing role mining algorithms do not handle SoD constraints and cannot be easily extended to incorporate SoD constraints. In this paper, we consider the problem of role mining when SoD constraints are present. We develop three alternative approaches that can be applied either during or after role mining. We evaluate the performance of all three approaches on several real world data sets and demonstrate their effectiveness.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectManagementen_US
dc.subjectRBACen_US
dc.subjectRole miningen_US
dc.subjectSeparation of dutyen_US
dc.subjectSMER constraintsen_US
dc.titleRole Mining in the Presence of Separation of Duty Constraintsen_US
dc.typeArticleen_US
Appears in Collections:Department of Management

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.