一种用于管理撤销证书的二进制树算法

Using Binary Tree to Manage Revoked Certificates

针对管理撤销证书的2 3树中,证书验证请求回应和证书验证过程的复杂性问题,提出了采用二进制树来代替2 3树,对撤销的证书进行管理,简化了树的结构和节点的属性。利用节点的全局编号,方便了节点在树中的定位和索引;利用唯一路径编号,简化了证书的相邻性验证过程。从而提高了证书验证过程中,服务端证书验证请求回应和客户端证书验证的计算效率,使得应用二进制树对撤销证书进行管理向实用化方向迈进了一步。

In view of the complexity of certificate verification response and certificate verification in the 2-3 tree for managing revoked certificates, the binary tree is used to replace the 2-3 tree to manage the revoked certificates. It can simplify the structure of the tree and the attribute of the nods. By using the global number of the nods, locating and indexing of the nods become easy. And by using unique numbering of paths, processing of neighbourship verification is simplified greatly. Thus, the computing efficiency of certificate verification response of the server and certificate verification of the client is improved, and using the binary tree to manage revoked certificates becomes more practical.