论文部分内容阅读
文中介绍了当前公钥基础设施中静态证书撤销树、线索二叉排序Hash树、平衡二叉排序Hash树以及2-3Hash树方案。对具有一定规模结点的上述后三种方案进行了实验模拟,实验结果表明:平衡二叉排序Hash树方案的证书验证长度较短,但是在树更新时,耗费的时间比其它两种方案长;2-3Hash树方案在验证已撤销证书的有效性时,其验证长度与平衡二叉排序Hash树方案的证书验证长度相差不大,但在验证有效证书的有效性时,其验证长度大约是平衡二叉排序Hash树方案的证书验证长度的2倍。
This paper introduces the static certificate revocation tree, clues binary Hash tree, balanced binary Hash tree and 2-3 Hash tree in the public key infrastructure. Experimental results on the latter three schemes with nodes of a certain size show that the Binary Hash Tree scheme has a short certificate length but takes longer to update than the other two schemes ; 2-3Hash tree scheme verifies the validity of the revoked certificate, its verification length is not much different from that of the balanced binary Hash tree scheme. However, when verifying the validity of the valid certificate, the verification length is about Balanced Binary Sort The Hash tree scheme has twice the certificate validation length.