Efficient certificate revocation system implementation: Huffman Merkle Hash Tree (HuffMHT)

Authors:
Jose L. Muñoz;Jordi Forné;Oscar Esparza;Manel Rey
Affiliations:
Technical University of Catalonia (Telematics Engineering Department), Barcelona, Spain;Technical University of Catalonia (Telematics Engineering Department), Barcelona, Spain;Technical University of Catalonia (Telematics Engineering Department), Barcelona, Spain;Technical University of Catalonia (Telematics Engineering Department), Barcelona, Spain
Venue:
TrustBus'05 Proceedings of the Second international conference on Trust, Privacy, and Security in Digital Business
Year:
2005

Citing 5
Cited 2

A Certified Digital Signature

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On Certificate Revocation and Validation

FC '98 Proceedings of the Second International Conference on Financial Cryptography
Certificate revocation system implementation based on the Merkle hash tree

International Journal of Information Security
Towards a framework for evaluating certificate status information mechanisms

Computer Communications
Certificate revocation and certificate update

IEEE Journal on Selected Areas in Communications

A practical and efficient tree-list structure for public-key certificate validation

ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Flooding-resilient broadcast authentication for VANETs

MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The public-key is usually made public by way of a digital document called Identity Certificate (IC). ICs are valid during quite long periods of time. However, there are circumstances under which the validity of an IC must be terminated sooner than assigned and thus, the IC needs to be revoked. In this paper, we present practical aspects of a certificate revocation system called Huffman Merkle Hash Tree (HuffMHT). HuffMHT provides an efficient and balanced performance with regards other proposals in the sense that the system does not save bandwidth at the expense of processing capacity and viceversa. Finally, some performance results of HuffMHT are exposed as well.