Paper 2008/187

An Efficient and Provably Secure ID-Based Threshold Signcryption Scheme

Fagen Li and Yong Yu

Abstract

Signcryption is a cryptographic primitive that performs digital signature and public key encryption simultaneously, at a lower computational costs and communication overheads than the signature-then-encryption approach. Recently, two identity-based threshold signcryption schemes[12],[26] have been proposed by combining the concepts of identity-based threshold signature and signcryption together. However, the formal models and security proofs for both schemes are not considered. In this paper, we formalize the concept of identity-based threshold signcryption and give a new scheme based on the bilinear pairings. We prove its confidentiality under the Decisional Bilinear Diffie-Hellman assumption and its unforgeability under the Computational Diffie-Hellman assumption in the random oracle model. Our scheme turns out to be more efficient than the two previously proposed schemes.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. ICCCAS 2008
Contact author(s)
fagenli @ uestc edu cn
History
2009-04-07: revised
2008-04-29: received
See all versions
Short URL
https://ia.cr/2008/187
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/187,
      author = {Fagen Li and Yong Yu},
      title = {An Efficient and Provably Secure ID-Based Threshold Signcryption Scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2008/187},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/187}},
      url = {https://eprint.iacr.org/2008/187}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.