Paper 2011/601

A Multi-Receiver ID-Based Generalized Signcryption Scheme

Caixue Zhou

Abstract

Generalized signcryption(GSC) can adaptively work as an encryption scheme, a signature scheme or a signcryption scheme with only one algorithm. In this paper, the formal definition and security notions of multi-receiver identity-based generalized signcryption (MID-GSC) are defined. A concrete scheme is also proposed and proved to be confidential under the Bilinear Diffie-Hellman (BDH) assumption and existential unforgeable under the Computational Diffie-Hellman(CDH) assumption in the random oracle model, which only needs one pairing computation to generalized signcrypt a single message for n receivers using the randomness re-use technique. Compared with other multi-receiver ID-based signcryption schemes, the new scheme is also of high efficiency.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. no publication
Keywords
Bilinear pairingProvable securityRandomness re-useSelective identity securityRandom oracle model
Contact author(s)
charlesjjjx @ 126 com
History
2011-11-10: received
Short URL
https://ia.cr/2011/601
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/601,
      author = {Caixue Zhou},
      title = {A Multi-Receiver ID-Based Generalized Signcryption Scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2011/601},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/601}},
      url = {https://eprint.iacr.org/2011/601}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.