Paper 2004/121

Fast and Proven Secure Blind Identity-Based Signcryption from Pairings

Tsz Hon Yuen and Victor K. Wei


We present the first blind identity-based signcryption (BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability (p1m-uf). We present an efficient construction from pairings, then prove a security theorem that reduces its p1m-uf to Schnorr¡¦s ROS Problem in the random oracle model plus the generic group and pairing model. The latter model is an extension of the generic group model to add support for pairings, which we introduce in this paper. In the process, we also introduce a new security model for (non-blind) identity-based signcryption (IBSC) which is a strengthening of Boyen¡¦s. We construct the first IBSC scheme proven secure in the strenghened model which is also the fastest (resp. shortest) IBSC in this model or Boyen¡¦s model. The shortcomings of several existing IBSC schemes in the strenghened model are shown.

Note: Extend the definition for generic group and pairing model

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Blind Identity Based Signcryption
Contact author(s)
kwwei @ ie cuhk edu hk
2004-06-13: last of 4 revisions
2004-05-26: received
See all versions
Short URL
Creative Commons Attribution


      author = {Tsz Hon Yuen and Victor K.  Wei},
      title = {Fast and Proven Secure Blind Identity-Based Signcryption from Pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2004/121},
      year = {2004},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.