The search functionality is under construction.
The search functionality is under construction.

Certificate Revocation Protocol Using k-Ary Hash Tree

Hiroaki KIKUCHI, Kensuke ABE, Shohachiro NAKANISHI

  • Full Text Views

    0

  • Cite this

Summary :

Certificate Revocation is a critical issue for a practical, public-key infrastructure. A new efficient revocation protocol using a one-way hash tree structure (instead of the classical list structure, which is known as a standard for revocation), was proposed and examined to reduce communication and computation costs. In this paper, we analysis a k-ary hash tree for certificate revocation and prove that k = 2 minimizes communication cost.

Publication
IEICE TRANSACTIONS on Communications Vol.E84-B No.8 pp.2026-2032
Publication Date
2001/08/01
Publicized
Online ISSN
DOI
Type of Manuscript
Special Section PAPER (Special Issue on Internet Technology)
Category
Internet Architecture

Authors

Keyword