The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
인증서 해지는 실용적인 공개 키 인프라에 있어서 중요한 문제입니다. 통신 및 계산 비용을 줄이기 위해 (폐기 표준으로 알려진 고전적인 목록 구조 대신) 단방향 해시 트리 구조를 사용하는 새로운 효율적인 철회 프로토콜이 제안되고 검토되었습니다. 이 논문에서 우리는 k-인증서 취소를 위한 해시 트리 및 이를 증명 k = 2는 통신 비용을 최소화합니다.
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.
부
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
부
@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},}
부
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 -