Abstract
A CRL (Certificate Revocation List) defined in X.509 is currently used for certificate revocation. There are some issues of CRL including a high communication cost and a low latency for update. To solve the issues, there are many proposals including CRT (Certificate Revocation Tree), Authenticated Dictionary, and Delta List. In this paper, we study CRT using k-valued hash tree. To estimate the optimal value of k, we examine the overhead of computation and the communication cost. We also discuss when a CRT should be reduced by eliminating unnecessary entries that are already expired.
Cite
CITATION STYLE
Kikuchi, H., Abe, K., & Nakanishi, S. (1999). Performance evaluation of certificate revocation using k-valued hash tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1729, pp. 103–117). Springer Verlag. https://doi.org/10.1007/3-540-47790-x_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
