Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Science》 2005-06
Add to Favorite Get Latest Update

An Improved Method of Certificate Revocation Based on 2-3 Tree

HUANG Ying-Chun;HE Liang-Sheng;JIANG Fan Department of Computer Scienee and Technology,University of Science and Technology of China,Hefei 230027 The State Key Laboratory of Information Security,Beijing 100039  
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.
【Fund】: 国家“863”计划项目(2003AA148050)资助
【CateGory Index】: TN918.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved