计算机应用 ›› 2012, Vol. 32 ›› Issue (03): 686-689.DOI: 10.3724/SP.J.1087.2012.00686

• 信息安全 • 上一篇    下一篇

自动信任协商中环策略依赖检测技术

王凯1,2,张红旗1,2,任志宇1,2   

  1. 1.信息工程大学 电子技术学院, 郑州 450004;
    2.河南省信息安全重点实验室, 郑州 450004
  • 收稿日期:2011-09-01 修回日期:2011-11-18 发布日期:2012-03-01 出版日期:2012-03-01
  • 通讯作者: 王凯
  • 作者简介:王凯(1987-),男,四川射洪人,硕士研究生,主要研究方向:信任协商、访问控制;张红旗(1962-),男,河北遵化人,教授,博士生导师,博士,主要研究方向:等级保护、信任管理、网络安全;任志宇(1974-),女,河南汤阴人,讲师,博士研究生,主要研究方向:授权管理、访问控制。
  • 基金资助:

    国家863计划项目(2006AA01Z457, 2009AA01Z438);国家973计划项目(2011CB311801);河南省科技创新人才计划项目(114200510001)。

Cyclic policy interdependency detection in automated trust negotiation

WANG Kai1,2, ZHANG Hong-qi1,2, REN Zhi-yu1,2   

  1. 1.Electronic Technology Institute, Information Engineering University, Zhengzhou Henan 450004, China;
    2.Henan Province Key Laboratory of Information Security, Zhengzhou Henan 450004, China
  • Received:2011-09-01 Revised:2011-11-18 Online:2012-03-01 Published:2012-03-01
  • Contact: Kai WANG

摘要: 针对自动信任协商(ATN)可能出现协商过程无限循环的问题,对循环产生的原因进行了分析并设计相应的检测算法以及时发现并终止协商循环。协商双方策略间的依赖关系存在环是无限循环协商产生的原因,将策略间的依赖关系建模成简单图并证明了模型的正确性;分析简单图的可达矩阵计算过程并给出简单图环检测定理,基于该定理设计检测算法对环策略依赖进行检测。最后,通过实例验证了算法的可行性。

关键词: 自动信任协商, 属性证书, 访问控制, 环策略依赖, 简单图, 可达矩阵

Abstract: For Automated Trust Negotiation (ATN) consultative process may encounter the infinite cycling problem, the causes of the cycle were analyzed and the corresponding detection algorithm was designed to find and terminate the negotiation cycle. Interdependency relationships among policies in ATN were modeled as simple graph and the model's correctness was proved. The process of calculating simple grahp's reachability matrix was analyzed and cycle detection theorem was given. The algorithm of detecting cyclic policy interdependency was designed according to the theorem. Finally, a case study verifies the feasibility of the algorithm.

Key words: Automated Trust Negotiation (ATN), attribute certificate, access control, cyclic policy interdependency, simple graph, reachability matrix

中图分类号: