2015
DOI: 10.1007/978-3-319-26961-0_7
|View full text |Cite
|
Sign up to set email alerts
|

Role Mining in the Presence of Separation of Duty Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(8 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…The concurrent processing method implements optimization with double constraints during the process of role mining. In addition to these methods for satisfying cardinality constraints, Sarana et al [40] proposed three role-optimization methods, including separation-of-duty constraints either, during, or after, the mining process. In order to satisfy separation-of-duty constraints and ensure authorization security, Sun et al [41] proposed a method called role-mining optimization, with separation-of-duty constraints and security detection for authorizations.…”
Section: Methods Of Role Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…The concurrent processing method implements optimization with double constraints during the process of role mining. In addition to these methods for satisfying cardinality constraints, Sarana et al [40] proposed three role-optimization methods, including separation-of-duty constraints either, during, or after, the mining process. In order to satisfy separation-of-duty constraints and ensure authorization security, Sun et al [41] proposed a method called role-mining optimization, with separation-of-duty constraints and security detection for authorizations.…”
Section: Methods Of Role Optimizationmentioning
confidence: 99%
“…Meanwhile, it is observed in Section 1 and Section 2 that the methods proposed by Kumar et al [35] and Blundo et al [36] only satisfied the cardinality constraint RPC; the method proposed by Hingankar et al [37] only satisfied the RUC; the CPA and RPA proposed by John et al [38] only satisfied the UCC; the method proposed by Ma et al [26] satisfied the RUC or RPC; the methods proposed by Sarana et al [40] did not satisfy any cardinality constraint but satisfied the SMER constraints; the methods proposed by Harika et al [39] could satisfy the UCC and PCC simultaneously. In addition, the system status was unknown using any of these methods.…”
Section: Advantages and Limitations Of The Reo_ccumecmentioning
confidence: 99%
“…At this, a -SMER constraint specifies a set of roles, of which only less that roles can be assigned to the same user. In addition, approaches for the generation of such SMER-constraints and for SoD-aware role mining are presented [17].…”
Section: Compliance Constraintsmentioning
confidence: 99%
“…Lu et al [23] also turned role mining problem into the optimal decomposition problem of the Boolean matrix, and used integer linear programming (ILP) to achieve role mining. Sarana et al [24] introduced separation of duty into the role mining, using minimum biclique cover (MBC) to achieve role mining. Zhang et al [25] designed a role mining model based on concept lattice, and found the minimum role set through the greedy algorithm of role substitution.…”
Section: Related Workmentioning
confidence: 99%