Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles

By Dan Boneh and Xavier Boyen.

In Advances in Cryptology (EUROCRYPT 2004), volume 3027 of Lecture Notes in Computer Science, pages 223-238. Springer, 2004.

Abstract

We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model in groups equipped with a bilinear map. Selective identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time to the identity that it intends to attack, whereas in the standard model the adversary is allowed to choose this identity adaptively. The first system is based on the decisional bilinear Diffie-Hellman assumption, and extends to give a selective identity Hierarchical IBE secure without random oracles. The second system is based on a related assumption called the bilinear Diffie-Hellman inversion assumption. Applications of either system include an efficient CCA2 public key cryptosystem that supports non-interactive threshold decryption in the standard model, and a simple and practical IBE system that remains secure against full adaptive-ID attacks, under some security penalty, without random oracles.

Keywords

Identity-based encryption, bilinear groups, selective-ID security, full IBE security, CCA2 security, bilinear Diffie-Hellman inversion, public-key encryption, probable security.

Material

- published paper (accessible from the publisher) © IACR
- expanded version (PS) (PDF)
- presentation slides (HTML)

Reference

@InProceedings{Boneh+Boyen:EUROCRYPT-2004:selectiveibe,
  author = {Dan Boneh and Xavier Boyen},
  title = {Efficient Selective-{ID} Secure Identity Based Encryption Without Random Oracles},
  booktitle = {Advances in Cryptology---EUROCRYPT 2004},
  series = {Lecture Notes in Computer Science},
  volume = {3027},
  pages = {223--238},
  publisher = {Berlin: Springer-Verlag},
  year = {2004},
  note = {Available at \url{http://www.cs.stanford.edu/~xb/eurocrypt04b/}}
}