基于开放逻辑R反驳计算的访问控制策略精化
发布时间：2018-07-17 15:46
【摘要】：策略精化是解决分布式应用访问控制策略配置复杂性的重要方法,现有精化技术给出了策略分层描述和逐层精化的方法,但处理策略之间关联问题的能力不足.基于精化树描述策略和策略关联,基于叶结点策略冲突判断,采用开放逻辑R反驳计算分析精化树策略关联属性,能够消解策略冲突同时保证策略互斥、组合、访问路径协同、精化映射等关联正确,并能够按序消解不同类型策略冲突、自由取舍相冲突的策略.实验与分析计算性能表明,该方法符合Saa S平台客户应用系统策略精化需求.
[Abstract]:Policy refinement is an important method to solve the complexity of configuration of access control policies in distributed applications. The existing refinement techniques give the methods of policy hierarchy description and layer by layer refinement, but the ability to deal with the problem of policy correlation is insufficient. Based on the refined tree description strategy and policy association, based on the decision of leaf node policy conflict, the open logic R is used to refute and analyze the attribute of refined tree policy association, which can resolve the policy conflict and ensure the policy mutex, combination and access path cooperation. The refined mapping is correct, and it can resolve the conflict of different types of strategy in order and choose the conflict freely. The experimental and computational results show that the method meets the needs of SAA S platform customer application system strategy refinement.
【作者单位】： 计算机软件新技术国家重点实验室(南京大学);
【基金】：国家高技术研究发展计划(863)(2011AA01A202)
【分类号】：TP393.08
[Abstract]:Policy refinement is an important method to solve the complexity of configuration of access control policies in distributed applications. The existing refinement techniques give the methods of policy hierarchy description and layer by layer refinement, but the ability to deal with the problem of policy correlation is insufficient. Based on the refined tree description strategy and policy association, based on the decision of leaf node policy conflict, the open logic R is used to refute and analyze the attribute of refined tree policy association, which can resolve the policy conflict and ensure the policy mutex, combination and access path cooperation. The refined mapping is correct, and it can resolve the conflict of different types of strategy in order and choose the conflict freely. The experimental and computational results show that the method meets the needs of SAA S platform customer application system strategy refinement.
【作者单位】： 计算机软件新技术国家重点实验室(南京大学);
【基金】：国家高技术研究发展计划(863)(2011AA01A202)
【分类号】：TP393.08
【参考文献】
相关期刊论文 前5条
1 李未;一个开放的逻辑系统[J];中国科学(A辑 数学 物理学 天文学 技术科学);1992年10期
2 李未;R-演算:一个修正程序规约的演算系统[J];中国科学E辑:技术科学;2002年05期
3 苏开乐;R-reconstruction in open logic[J];Chinese Science Bulletin;1995年05期
4 吴迎红;黄皓;周靖康;曾庆凯;;分布式应用访问控制策略精化冲突分析[J];计算机应用;2014年02期
5 苏开乐,丁德成;关于事实反驳与一般假说的开放逻辑[J];科学通报;1994年16期
【共引文献】
相关期刊论文 前10条
1 刘鹏;胡建斌;陈钟;;分布式计算环境下的语义安全策略语言(英文)[J];北京大学学报(自然科学版);2006年05期
2 李未,马世龙,眭跃飞,许可;收敛无穷计算及其应用[J];北京航空航天大学学报;2002年05期
3 张文q，
本文编号：2130145
本文链接：https://www.wllwen.com/guanlilunwen/ydhl/2130145.html
