节点文献
带权强分离信任委托路径搜索
Weighted strongest disjoint path search algorithm in trust management
【摘要】 在委托证书路径搜索和一致性证明时,在Keynote提出的证书图的基础上,采用有向图中深度优先遍历的思想以及图的动态特性,提出了一种新的一致性验证算法,通过找出一条最佳的带权分离委托路径可以表达否定安全凭证,同时通过有向图的搜索边标记提高搜索效率并有效避免回路循环搜索的问题。
【Abstract】 This paper presented a novel proof of compliance algorithm based on Keynote credential graph,which mainly found out a best weight strongest disjoint path in a directed graph to process negative credential.It used the searched edge labeled during searching process to avoid the cyclic path and improved proof speed.
【基金】 国家自然科学基金(60372046,60573043);现代通信国家重点实验室基金(9140c1108010606)
- 【文献出处】 计算机应用研究 ,Application Research of Computers , 编辑部邮箱 ,2007年09期
- 【分类号】TP393.08
- 【下载频次】75