摘要
针对自动信任协商(ATN)可能出现协商过程无限循环的问题,对循环产生的原因进行了分析并设计相应的检测算法以及时发现并终止协商循环。协商双方策略间的依赖关系存在环是无限循环协商产生的原因,将策略间的依赖关系建模成简单图并证明了模型的正确性;分析简单图的可达矩阵计算过程并给出简单图环检测定理,基于该定理设计检测算法对环策略依赖进行检测。最后,通过实例验证了算法的可行性。
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.
出处
《计算机应用》
CSCD
北大核心
2012年第3期686-689,693,共5页
journal of Computer Applications
基金
国家863计划项目(2006AA01Z457
2009AA01Z438)
国家973计划项目(2011CB311801)
河南省科技创新人才计划项目(114200510001)
关键词
自动信任协商
属性证书
访问控制
环策略依赖
简单图
可达矩阵
Automated Trust Negotiation(ATN)
attribute certificate
access control
cyclic policy interdependency
simple graph
reachability matrix