arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1203.3744cs.CR
收藏

约束角色挖掘

Constrained Role Mining

Carlo Blundo, Stelvio Cimato

摘要:

基于角色的访问控制(RBAC)是一种非常流行的访问控制模型,经过长期的研究,并广泛应用于不同企业的安全体系结构中。要实现RBAC,必须首先在所考虑的组织中识别角色。通常,从分配给每个用户的权限开始,以自自底向上的的方式(自动)定义角色的过程称为{ \it role mining}。在文献中,角色挖掘问题已被正式分析,并提出了几种技术,以获得一组有效的角色。最近,定义不同种类的限制的数量和大小的角色,包括在所得到的角色集的问题已经得到解决。在本文中,我们提供了一个正式的定义下的基数约束,即限制的最大数量的权限,可以包括在一个角色的角色挖掘问题。我们正式讨论的计算复杂性的问题,并提出了一种新的启发式。此外,我们提出的实验结果后,提出的启发式应用程序在真实和合成数据集,并比较所产生的性能与以前的建议

英文摘要:

Role Based Access Control (RBAC) is a very popular access control model, for long time investigated and widely deployed in the security architecture of different enterprises. To implement RBAC, roles have to be firstly identified within the considered organization. Usually the process of (automatically) defining the roles in a bottom up way, starting from the permissions assigned to each user, is called {\it role mining}. In literature, the role mining problem has been formally analyzed and several techniques have been proposed in order to obtain a set of valid roles. Recently, the problem of defining different kind of constraints on the number and the size of the roles included in the resulting role set has been addressed. In this paper we provide a formal definition of the role mining problem under the cardinality constraint, i.e. restricting the maximum number of permissions that can be included in a role. We discuss formally the computational complexity of the problem and propose a novel heuristic. Furthermore we present experimental results obtained after the application of the proposed heuristic on both real and synthetic datasets, and compare the resulting performance to previous proposals

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑