全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
软件学报  2001 

Threaded Binary Sorted Hash Trees Solution Scheme for Certificate Revocation Problem
证书吊销的线索二叉排序Hash树解决方案

Keywords: public key infrastructure,CA (certification anthority),public key certificate,certificate revocation,digital signature
公钥基础设施
,证书权威,公钥证书,证书吊销,数字签名

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133