%0 Journal Article
%T An Improved Method of Certificate Revocation Based on 2-3 Tree<br>对2-3树证书撤销方法的改进
%A HUANG Ying-chun
%A HE Liang-sheng
%A JIANG Fan
%A <br>黄迎春
%A 何良生
%A 蒋凡
%J 计算机科学
%D 2005
%I 
%X There are many advantages of 2-3 tree method for certificate revocation in communication costs and compu- tation costs. However, with the tree nods increasing, the method also shows some shortages, such as the costs of tree adjust will be too high. Based on the beginning time of the certificate to be valid the certificate's remainder valid peri- od can be counted easily and then be used to partition the set of the certificates. We build a 2-3 tree in each subset. It is called cursor tree of remainder valid priod and much shorter than the primary tree. Moreover, for the overdue cer- tificate in the revocation set, CA and directory need not delete it, so the communication and computation costs can also be reduced.
%K Certificate
%K Cursor tree of remainder valid period
%K CRL
%K 2-3tree<br>证书
%K 剩余有效期游标树
%K CRL
%K 2-3树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=241D7217D9547716&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=B31275AF3241DB2D&sid=8BD23BD67BF01A5C&eid=68D88C2FCF9C3098&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=8