Abstract: The paper puts forward a new proof of compliance algorithm in PolicyMaker, the algorithm applies graphic theory’s DFS notion and the dynamic character, in the face of withdrawing the delegation, deletes the delegation side, then newly searches, finds other chain discovery until the end. It solves the negative credentials, compared with the time and space complicated degree of the original arithmetic, the algorithm is more simple and shortcut.

Key words: Trust management, Negative credential, Graphic

摘要： 提出了PolicyMaker信任管理系统的一种新的一致性验证算法，此算法运用图论中的深度优先遍历理论以及图的动态特性，在遇到撤消授权关系的凭证时，将其对应的边删除，然后重新搜索，寻找其他证书链直至搜索结束。它解决了原算法中否定安全凭证的问题，并且通过与原算法时间复杂度与空间复杂度的比较，证明此算法更加简单快捷。

关键词: 信任管理, 否定安全凭证, 图论

CLC Number: 

• TP391