Efficient identity-based signcryption scheme for multiple receivers

  • Authors:
  • Yong Yu;Bo Yang;Xinyi Huang;Mingwu Zhang

  • Affiliations:
  • National Key Lab. of ISN, Xidian University, Xi'an, P.R. China;College of information, South China Agricultural University, Guangzhou, P.R. China;School of Computer Science and Software Engineering, University of Wollongong Wollongong, NSW, Australia;College of information, South China Agricultural University, Guangzhou, P.R. China

  • Venue:
  • ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Signcryption is a cryptographic primitive that performs signature and encryption simultaneously. In this paper, we propose an efficient identity based signcryption scheme for multiple receivers which needs only one pairing computation to signcrypt a message for n different receivers and can provide confidentiality and authenticity simultaneously. This scheme turns out to be more efficient than all others proposed so far. We prove its security in the random oracle model. Specifically, we prove its semantic security under the hardness of Bilinear Diffie-Hellman (BDH) problem and its unforgeability under the Computational Diffie-Hellamn (CDH) assumption.