Reference

  • Adaptive-ID Secure Revocable Identity-Based Encryption.

    (with Benoît Libert) Topics in cryptology - CT-RSA 2009
    (M. Fischlin ed.)
    Springer, Lect. Notes Comput. Sci. vol. 5473, 2009, p. 1-15
top

Abstract

Identity-Based Encryption (IBE) offers an interesting alternative to PKI-enabled encryption as it eliminates the need for digital certificates. While revocation has been thoroughly studied in PKIs, few revocation mechanisms are known in the IBE setting. Until quite recently, the most convenient one was to augment identities with period numbers at encryption. All non-revoked receivers were thus forced to obtain a new decryption key at discrete time intervals, which places a significant burden on the authority. A more efficient method was suggested by Boldyreva, Goyal and Kumar at CCS'08. In their revocable IBE scheme, key updates have logarithmic (instead of linear in the original method) complexity for the trusted authority. Unfortunately, security could only be proved in the selective-ID setting where adversaries have to declare which identity will be their prey at the very beginning of the attack game. In this work, we describe an adaptive-ID secure revocable IBE scheme and thus solve a problem left open by Boldyreva et al..

Keywords

Identity-based encryption, Revocation, Provable security

top

Download

[abs]   Abstract
[bib]   BibTeX Entry
[doi]   Official version
[ps] [pdf]   Proceedings version
top