An Efficient Certificate Path Discovery Algorithm Making High a Certificate Path Validity 


Vol. 29,  No. 12, pp. 1722-1728, Dec.  2004


PDF
  Abstract

To discover a certificate path is a very important topic in the PKI with a lot of candidate paths. The certificate path discovery processing is executed via many verificattons and as the number of verification times increases, the validity of the discovered path becomes high. The selection of the path with high validity provides high-speed certificate validation by reducing the number of repetition times of path discovery and validation processing. Otherwise, there is a problem that the speed and computation overheads are increased. In this paper, we propose an efficient certificate path discovery algorithm can make high the certificate validity with low overhead.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Choi and M. Jun, "An Efficient Certificate Path Discovery Algorithm Making High a Certificate Path Validity," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 12, pp. 1722-1728, 2004. DOI: .

[ACM Style]

Yeon-hee Choi and Moon-seog Jun. 2004. An Efficient Certificate Path Discovery Algorithm Making High a Certificate Path Validity. The Journal of Korean Institute of Communications and Information Sciences, 29, 12, (2004), 1722-1728. DOI: .

[KICS Style]

Yeon-hee Choi and Moon-seog Jun, "An Efficient Certificate Path Discovery Algorithm Making High a Certificate Path Validity," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 12, pp. 1722-1728, 12. 2004.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880