Satisfiability problem of authorization require- ments in business process asks whether there exists an as- signment of users to tasks that satisfies all the requirements, and methods were proposed to solve this probl...Satisfiability problem of authorization require- ments in business process asks whether there exists an as- signment of users to tasks that satisfies all the requirements, and methods were proposed to solve this problem. However, the proposed methods are inefficient in the sense that a step of the methods is searching all the possible assignments, which is time-consuming. This work proposes a method to solve the satisfiability problem of authorization requirements with- out browsing the assignments space. Our method uses im- proved separation of duty algebra （ISoDA） to describe a sat- isfiability problem of qualification requirements and quan- tification requirements （Separation of Duty and Binding of Duty requirements）. Thereafter, ISoDA expressions are re- duced into multi-mutual-exclusive expressions. The satisfia- bilities of multi-mutual-exclusive expressions are determined by an efficient algorithm proposed in this study. The experiment shows that our method is faster than the state-of-the-art methods.展开更多
分析了当前Clark-Wilson完整性模型实现机制的不足,提出了一种基于TE实现Clark-Wilson模型的方法.首先讨论了TE对Clark-Wilson模型的支持能力,然后给出了用TE实现Clark-Wilson模型的配置规则和约束.在实现中,扩展了模型的(userid,TP,lis...分析了当前Clark-Wilson完整性模型实现机制的不足,提出了一种基于TE实现Clark-Wilson模型的方法.首先讨论了TE对Clark-Wilson模型的支持能力,然后给出了用TE实现Clark-Wilson模型的配置规则和约束.在实现中,扩展了模型的(userid,TP,list of CDIs)三元组,引入了角色层,以更实用的方式实现了职责隔离.同时,实现机制实现了对TP的保护,有效地保障了TP功能的正确性,提高了系统正确控制TP操作的可信度,减少了对Clark-Wilson模型验证规则的依赖.展开更多
现有的角色挖掘算法只为追求得到最小角色集的挖掘结果,并没有考虑到系统中的职责分离(Separation of Duty,SoD),而SoD是维护系统安全的重要约束。对此,提出一种基于职责分离的角色挖掘算法。将用户权限关系转化成布尔矩阵表示,利用权...现有的角色挖掘算法只为追求得到最小角色集的挖掘结果,并没有考虑到系统中的职责分离(Separation of Duty,SoD),而SoD是维护系统安全的重要约束。对此,提出一种基于职责分离的角色挖掘算法。将用户权限关系转化成布尔矩阵表示,利用权限分组的方法在角色挖掘过程中为角色赋予SoD约束信息。生成静态互斥角色t-t SMER(Statically Mutually Exclusive Roles,SMER)约束集,利用该约束集实现系统中SoD约束。实验结果表明该算法执行效率高,能够有效维护系统安全。展开更多
文摘Satisfiability problem of authorization require- ments in business process asks whether there exists an as- signment of users to tasks that satisfies all the requirements, and methods were proposed to solve this problem. However, the proposed methods are inefficient in the sense that a step of the methods is searching all the possible assignments, which is time-consuming. This work proposes a method to solve the satisfiability problem of authorization requirements with- out browsing the assignments space. Our method uses im- proved separation of duty algebra （ISoDA） to describe a sat- isfiability problem of qualification requirements and quan- tification requirements （Separation of Duty and Binding of Duty requirements）. Thereafter, ISoDA expressions are re- duced into multi-mutual-exclusive expressions. The satisfia- bilities of multi-mutual-exclusive expressions are determined by an efficient algorithm proposed in this study. The experiment shows that our method is faster than the state-of-the-art methods.
文摘分析了当前Clark-Wilson完整性模型实现机制的不足,提出了一种基于TE实现Clark-Wilson模型的方法.首先讨论了TE对Clark-Wilson模型的支持能力,然后给出了用TE实现Clark-Wilson模型的配置规则和约束.在实现中,扩展了模型的(userid,TP,list of CDIs)三元组,引入了角色层,以更实用的方式实现了职责隔离.同时,实现机制实现了对TP的保护,有效地保障了TP功能的正确性,提高了系统正确控制TP操作的可信度,减少了对Clark-Wilson模型验证规则的依赖.
