Algorithms & data structures
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Performance Evaluation of Certificate Revocation Using k-Valued Hash Tree
ISW '99 Proceedings of the Second International Workshop on Information Security
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Performance Evaluation of Certificate Revocation Using k-Valued Hash Tree
ISW '99 Proceedings of the Second International Workshop on Information Security
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
| Hi-index | 0.00 |
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.