| 自动信任协商中环策略依赖检测技术 |
| |
| 引用本文： | 王凯,张红旗,任志宇.自动信任协商中环策略依赖检测技术[J].计算机应用,2012,32(3):686-689. |
| |
| 作者姓名： | 王凯 张红旗 任志宇 |
| |
| 作者单位： | 1.信息工程大学 电子技术学院, 郑州 450004;
2.河南省信息安全重点实验室, 郑州 450004 |
| |
| 基金项目： | 国家863计划项目，国家973计划项目，河南省科技创新人才计划项目 |
| |
| 摘 要： | 针对自动信任协商(ATN)可能出现协商过程无限循环的问题,对循环产生的原因进行了分析并设计相应的检测算法以及时发现并终止协商循环。协商双方策略间的依赖关系存在环是无限循环协商产生的原因,将策略间的依赖关系建模成简单图并证明了模型的正确性;分析简单图的可达矩阵计算过程并给出简单图环检测定理,基于该定理设计检测算法对环策略依赖进行检测。最后,通过实例验证了算法的可行性。
|
| 关 键 词： | 自动信任协商 属性证书 访问控制 环策略依赖 简单图 可达矩阵 |
| 收稿时间： | 2011-09-01 |
| 修稿时间： | 2011-11-18 |
Cyclic policy interdependency detection in automated trust negotiation |
| |
| WANG Kai
,
ZHANG Hong-qi
,
REN Zhi-yu.Cyclic policy interdependency detection in automated trust negotiation[J].journal of Computer Applications,2012,32(3):686-689. |
| |
| Authors: | WANG Kai ZHANG Hong-qi REN Zhi-yu |
| |
| Affiliation: | 1.Electronic Technology Institute, Information Engineering University, Zhengzhou Henan 450004, China;
2.Henan Province Key Laboratory of Information Security, Zhengzhou Henan 450004, China |
| |
| 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. |
| |
| Keywords: | Automated Trust Negotiation(ATN) attribute certificate access control cyclic policy interdependency simple graph reachability matrix |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
