%0 Journal Article
%T Threaded Binary Sorted Hash Trees Solution Scheme for Certificate Revocation Problem<br>证书吊销的线索二叉排序Hash树解决方案
%A WANG Shang ping
%A ZHANG Ya ling
%A WANG Yu min
%A <br>王尚平
%A 张亚玲
%A 王育民
%J 软件学报
%D 2001
%I 
%X A new solution scheme called certificate revocation threaded binary sorted Hash trees (CRTBSHT) for certificate revocation problem in public key infrastructure (PKI) is proposed in this paper. Previous solution schemes including traditional X.509 certificates system's certificate revocation lists (CRL), Micali's Certificate Revocation System (CRS), Kocher's Certificate Revocation Trees (CRT), and Naro-Nossim's 2-3 certificate revocation trees (2-3CRT), but no one is perfect. The new scheme keeps the good properties of CRT that it is easy to check or prove whether a certificate is revoked which only needs the related path values but does not need the whole CRT values and overcomes the disadvantage of CRT that any update will cause the whole CRT to be conmputed completely. The new scheme has referential value to the PKI engineering practice.
%K public key infrastructure
%K CA (certification anthority)
%K public key certificate
%K certificate revocation
%K digital signature<br>公钥基础设施
%K 证书权威
%K 公钥证书
%K 证书吊销
%K 数字签名
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=3F7102AC580CA9C4&yid=14E7EF987E4155E6&vid=59906B3B2830C2C5&iid=9CF7A0430CBB2DFD&sid=C91D29281694E9C8&eid=0B75D2720F0065BE&journal_id=1000-9825&journal_name=软件学报&referenced_num=10&reference_num=7