在委托证书路径搜索和一致性证明时,在Keynote提出的证书图的基础上,采用有向图中深度优先遍历的思想以及图的动态特性,提出了一种新的一致性验证算法,通过找出一条最佳的带权分离委托路径可以表达否定安全凭证,同时通过有向图的搜索边标记提高搜索效率并有效避免回路循环搜索的问题。
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.