ScholarLens Back to search
2007•Jisuanji gongchengRequires access

New Certificate Revocation List

Ding Yuan

Open publisher page 1 citations

Abstract

This paper discusses certificate revocation list (CRL). A CRL based on schedule storage is not perfect and it proposes a new CRL based on binary sorted tree. Compared to other methods, the new method can reduce the average search length that the certificate user looks for the revocative certificate compared with traditional CRL. It is capable of avoiding the disadvantage of the improved CRL that any update will cause the move of the records, and it optimizes the performance of the certificate revocation system. The scheme is easy to be realized.

About this research paper

What this paper is about

This paper discusses certificate revocation list (CRL). A CRL based on schedule storage is not perfect and it proposes a new CRL based on binary sorted tree. Compared to other methods, the new method can reduce the average search length that the certificate user looks for the revocative certificate compared with traditional CRL. It is capable of avoiding the disadvantage of the improved CRL that any update will cause the move of the records, and it optimizes the performance of the certificate revocation system. The scheme is easy to be realized.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper discusses certificate revocation list (CRL). A CRL based on schedule storage is not perfect and it proposes a new CRL based on binary sorted tree. Compared to other methods, the new method can reduce the average search length that the certificate user looks for the revocative certificate compared with traditional CRL. It is capable of avoiding the disadvantage of the improved CRL that any update will cause the move of the records, and it optimizes the performance of the certificate revocation system. The scheme is easy to be realized.

Key concepts: Revocation list, Computer science, Certificate, Root certificate, Revocation, Authorization certificate, Public key certificate, Computer security

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
New Certificate Revocation List — Research Paper | ScholarLens