文章基本信息

标题：How to Find a Rigorous Set of Roles for Application of RBAC
本地全文：下载
作者：Dong, Lijun ; Kang, Xiaojun ; Wang, Maocai 等
期刊名称：Journal of Software
印刷版ISSN：1796-217X
出版年度：2012
卷号：7
期号：2
页码：398-407
DOI：10.4304/jsw.7.2.398-407
语种：English
出版社：Academy Publisher
摘要：Role-based access control (RBAC) has been adopted successfully by a variety of security system by reducing the complexity of the management of access control. The least privilege principle is a very important constraint policy of RBAC. Devising a complete and correct set of roles for supporting the least privilege principle has been recognized as one of the most important tasks in implementing RBAC. A key problem is how to find such sets of roles which have the least permissions. In fact, when the number of role-permission assignments is large, it is almost impossible to find a rigorous set of roles which has the completely same set of permissions required by a user. To address this problem, we research the problem how to find such the rigorous combinations obeying the principle of least permissions. By bringing forward the concept of the l east privilege mining problem, we describe the methods to resolve the problem and some instances of its applications, too. Moreover, the corresponding algorithms are displayed. Specially, by analyzing the complexity of least privilege mining problem, the method based on evolutionary algorithm is shown appreciate. Correspondingly, the experiments are accomplished to prove our opinions. Finally, the paper is concluded and some future work is posed.
关键词：information security; role-based access control; least privilege; evolutionary algorithm