IEICE TRANSACTIONS on Communications
Certificate Revocation Protocol Using k-Ary Hash Tree
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
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroaki KIKUCHI, Kensuke ABE, Shohachiro NAKANISHI, "Certificate Revocation Protocol Using k-Ary Hash Tree" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 8, pp. 2026-2032, August 2001, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_8_2026/_p
Copy
@ARTICLE{e84-b_8_2026,
author={Hiroaki KIKUCHI, Kensuke ABE, Shohachiro NAKANISHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Certificate Revocation Protocol Using k-Ary Hash Tree},
year={2001},
volume={E84-B},
number={8},
pages={2026-2032},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Certificate Revocation Protocol Using k-Ary Hash Tree
T2 - IEICE TRANSACTIONS on Communications
SP - 2026
EP - 2032
AU - Hiroaki KIKUCHI
AU - Kensuke ABE
AU - Shohachiro NAKANISHI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2001
AB - 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.
ER -
English
