CAJ | 학술논문

基于概念格的RBAC模型是角色挖掘中的一个重要方向，在概念格上找出满足最小权限原则的最小角色集合有助于降低安全管理的复杂性。本文研究了在概念格的RBAC模型上的角色最小化问题及其算法。首先将角色最小化问题引入概念格模型，并给出了概念格模型上最小角色集、角色替代和角色约简的定义，和相关定理的证明。在此基础上建立了一个基于角色替代的角色最小化问题求解模型，并设计了一个贪婪算法。该算法以对象概念集为初始集，逐个将集合中的概念用它的父概念来替代和约简，自底向上地迭代求解最小角色集。实验与分析表明了本文相关理论和算法的有效性。
기우개념격적RBAC모형시각색알굴중적일개중요방향，재개념격상조출만족최소권한원칙적최소각색집합유조우강저안전관리적복잡성。본문연구료재개념격적RBAC모형상적각색최소화문제급기산법。수선장각색최소화문제인입개념격모형，병급출료개념격모형상최소각색집、각색체대화각색약간적정의，화상관정리적증명。재차기출상건립료일개기우각색체대적각색최소화문제구해모형，병설계료일개탐람산법。해산법이대상개념집위초시집，축개장집합중적개념용타적부개념래체대화약간，자저향상지질대구해최소각색집。실험여분석표명료본문상관이론화산법적유효성。
Roles minimization problem and its algorithm based on RBAC model are studied in this paper.Roles minimization problem is introduced into concept lattice model .The minimal set of roles,roles replacement and roles reduction are defined,and the corresponding theorems are proved .Based on this,the model of solving roles minimization problem based on roles replacement is created and a greedy algorithm is proposed .In this algorithm,the object concepts set is regarded as initial set,concetps in roles set are replaced and reducted by their parents one by one,and the minimal set of roles is solved by iteration in bottom-up way .Experi-ments show that the theory and the proposed algorithm are effective .