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.
This work was supported by the National Natural Science Foundation of China under Grants No. 60372046 and 60573043.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shamir, A.: Identity-based cryptosystem and signature scheme. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 120–126. Springer, Heidelberg (1985)
Zheng, Y.: Digital signcryption or how to achieve cost(signature & encryption) ≪ cost(signature)+cost(encryption). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165–179. Springer, Heidelberg (1997)
Petersen, H., Michels, M.: Cryptanalysis and improvement of signcryption schemes. IEE proceedings-Computers and Digital Techniques 145(2), 149–151 (1998)
Bao, F., Deng, R.H.: A signcryption scheme with signature directly verifiable by public key. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 55–59. Springer, Heidelberg (1998)
Zheng, Y., Imai, H.: How to construct efficient signcryption schemes on elliptic curves. Information Processing Letters 68(5), 227–233 (1998)
Malone-Lee, J., Mao, W.: Two birds one stone: signcryption using RSA. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 211–226. Springer, Heidelberg (2003)
Jung, H.Y., Lee, D.H., Lim, J.I., Chang, K.S.: New DSA-verifiable signcryption schemes. Information Security Application-WISA 2001, pp. 463–475 (2001)
Malone-Lee, J.: Identity based signcryption. Cryptology ePrint Archive. Report 2002/098 (2002)
Libert, B., Quisquator, J.J.: A new identity based signcryption scheme from pairings. In: 2003 IEEE information theory workshop. Paris, France, pp. 155–158 (2003)
Chow, S.S.M., Yiu, S.M., Hui, L.C.K., Chow, K.P.: Efficient forward and provably secure ID-based signcryption scheme with public verifiability and public ciphertext authenticity. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 352–369. Springer, Heidelberg (2004)
Boyen, X.: Multipurpose identity based signcryption: a swiss army knife for identity based cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 383–399. Springer, Heidelberg (2003)
Chen, L., Malone-Lee, J.: Improved identity-based signcryption. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 362–379. Springer, Heidelberg (2005)
Barreto, P.S.L.M., Libert, B., McCullagh, N., Quisquater, J.J.: Efficient and provably-secure identity based signatures and signcryption from bilinear maps. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 515–532. Springer, Heidelberg (2005)
Zheng, Y.: Signcryption and its applications in efficient public key solutions. In: Okamoto, E. (ed.) ISW 1997. LNCS, vol. 1396, pp. 291–312. Springer, Heidelberg (1998)
Duan, S., Cao, Z.: Efficient and provably secure multi-receiver identity-based signcryption. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol. 4058, pp. 195–206. Springer, Heidelberg (2006)
Baek, J., Safavi-Naini, R., Susilo, W.: Efficient multi-receiver identity based encryption and its application to broad encryption. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 380–397. Springer, Heidelberg (2005)
Yuen, T.H., Wei, V.K.: Fast and proven secure blind identity based signcryption from pairings. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 305–322. Springer, Heidelberg (2005)
Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve trace for FR-reduction. IEICE Tranctions on Fundamentals E84-A(5), 1234–1243 (2001)
Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–368. Springer, Heidelberg (2002)
Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)
Smart, N.P., Vercauteren, F.: On computable isomorphisms in efficient pairing based systems. Cryptology ePrint Archive, Report 2005/116 (2005), http://eprint.iacr.org/2005/116
Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)
Boneh, D., Boyen, X.: Efficient selective-ID secure identity based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 223–238. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, Y., Yang, B., Huang, X., Zhang, M. (2007). Efficient Identity-Based Signcryption Scheme for Multiple Receivers. In: Xiao, B., Yang, L.T., Ma, J., Muller-Schloer, C., Hua, Y. (eds) Autonomic and Trusted Computing. ATC 2007. Lecture Notes in Computer Science, vol 4610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73547-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-73547-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73546-5
Online ISBN: 978-3-540-73547-2
eBook Packages: Computer ScienceComputer Science (R0)