Separable implicit certificate revocation

  • Authors:
  • Dae Hyun Yum;Pil Joong Lee

  • Affiliations:
  • Information Security Lab., EEE, Postech, Korea;Information Security Lab., EEE, Postech, Korea

  • Venue:
  • ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The popular certificate revocation systems such as CRL and OCSP have a common drawback that they are explicit certificate revocation; the sender must obtain the revocation status information of the receiver’s certificate, before sending an encrypted message. Recently, an implicit certificate revocation system called ‘certificate-based encryption’ was introduced. In this model, a receiver needs both his private key and an up-to-date certificate from the CA (Certification Authority) to decrypt a ciphertext, while senders need not be concerned about the certificate revocation problem. Hence, the certificate-based encryption system has the advantage of light infrastructure requirement. However, the certificate-based encryption system has an important drawback that it is inseparable; only the CA can handle the certificate revocation problem and the load cannot be distributed among multiple trusted authorities. In this paper, we propose a separable implicit certificate revocation system called ‘status certificate-based encryption,’ in which the authenticity of a public key is guaranteed by a (long-lived) certificate and the certificate revocation problem is resolved by a (short-lived) status certificate. We present a secure construction based on bilinear mappings as well as definitional works.