Efficient and provably secure multi-recipient signcryption from bilinear pairings

EDP Sciences - Tập 12 - Trang 17-20 - 2007
Fagen Li1, Yupu Hu1, Shuanggen Liu1,2
1Key Laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi’an, China
2College of Computer Information Engineering, Jiangxi Normal University, Nanchang, China

Tóm tắt

Signcryption is a cryptographic primitive that performs signature and encryption simultaneously, at lower computational costs and communication overheads than the signature-then-encryption approach. In this paper, we propose an efficient multi-recipient signcryption scheme based on the bilinear pairings, which broadcasts a message to multiple users in a secure and authenticated manner. We prove its semantic security and unforgeability under the Gap Diffie-Hellman problem assumption in the random oracle model. The proposed scheme is more efficient than re-signcrypting a message n times using a signcryption scheme in terms of computational costs and communication overheads.

Tài liệu tham khảo

Zheng Y. Digital Signcryption or How to Achieve Cost (Signature & Encryption)<<Cost(Signature)+Cost(Encryption) [C]//CRYPTO’97. Berling: Springer, 1997:165–179. Baek J, Steinfeld R, Zheng Y. Formal Proofs for the Security of Signcryption[C]//PKC 2002. Berlin: Springer, 2002:80–98. Libert B, Quisquater J J. A New Identity Based Signcryption Schemes from Pairings[C]// 2003 IEEE Information Theory Workshop. New York: IEEE Press, 2003:155–158. Yuen T H, Wei V K. Fast and Proven Secure Blind Identity-Based Signcryption from Pairings[C]//RSA 2005. Berlin: Springer, 2005:305–322. Boyen X. Multipurpose Identity-Based Signcryption: A Swiss Army Knife for Identity-Based Cryptography [C]//CRYPTO 2003. Berlin: Springer, 2003:383–399. Chen L, Malone-Lee J. Improved Identity-Based Signcryption[C]//PKC 2005. Berlin: Springer, 2005:362–379. Barreto P S L M, Libert B, McCullagh N, et al. Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps[C]//ASIACRYPT 2005. Berlin: Springer, 2005:515–532. Yang G, Wong D S, Deng X. Analysis and Improvement of a Signcryption Scheme with Key Privacy[C]//ISC 2005. Berlin: Springer, 2005: 218–232. Libert B, Quisquater J J. Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups [C]//PKC 2004. Berlin: Springer, 2004:187–200. Zheng Y. Signcryption and Its Applications in Efficient Public Key Solutions[C]//ISW’97. Berlin: Springer, 1997:291–312. Li F, Hu Y, Liu S.Efficient and Provably Secure Muliti∖Recipient Signcryption from Bilinear Pairings [EB/OL]. [2006-10-07].http://eprint.iacr.org.