Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps

  • Paulo S. L. M. Barreto
  • Benoît Libert
  • Noel McCullagh
  • Jean-Jacques Quisquater
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3788)

Abstract

In this paper we describe a new identity-based signcryption (IBSC) scheme built upon bilinear maps. This scheme turns out to be more efficient than all others proposed so far. We prove its security in a formal model under recently studied computational assumptions and in the random oracle model. As a result of independent interest, we propose a new provably secure identity-based signature (IBS) scheme that is also faster than all known pairing-based IBS methods.

References

  1. 1.
    An, J.-H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 83–107. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Barreto, P.S.L.M.: The pairing based crypto lounge, http://planeta.terra.com.br/informatica/paulobarreto/pblounge.html
  3. 3.
    Barreto, P.S.L.M., Lynn, B., Scott, M.: On the selection of pairing-friendly groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 17–25. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. Cryptology ePrint Archive, Report 2005/133 (2005), http://eprint.iacr.org/2005/133
  5. 5.
    Bellare, M., Namprempre, C., Neven, G.: Security proofs for identity-based identification and signature schemes. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 268–286. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: 1st ACM Conference on Computer and Communications Security, Fairfax, USA, pp. 62–73. ACM Press, New York (1993)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Boneh, D., Boyen, X.: Secure identity based encryption without random oracles. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 443–459. Springer, Heidelberg (2004)Google Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Cha, J.C., Cheon, J.H.: An identity-based signature from gap Diffie-Hellman groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 18–30. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Chen, L., Cheng, Z.: Security proof of Sakai-Kasahara’s identity-based encryption scheme. Cryptology ePrint Archive, Report 2005/226 (2005), http://eprint.iacr.org/2005/226
  14. 14.
    Chen, L., Malone-Lee, J.: Improved identity-based signcryption. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 362–379. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Cheon, J.H., Kim, Y., Yoon, H.J.: A new id-based signature with batch verification. Cryptology ePrint Archive, Report 2004/131 (2004), http://eprint.iacr.org/2004/131
  16. 16.
    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)CrossRefGoogle Scholar
  17. 17.
    Chow, S.S.M., Yuen, T.H., Hui, L.C.K., Yiu, S.M.: Signcryption in hierarchical identity based cryptosystem. In: 20th International Conference on Information Security (SEC 2005). IFIP TC11 (2005)Google Scholar
  18. 18.
    Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360–363. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  19. 19.
    Dodis, Y., Katz, J., Xu, S., Yung, M.: Strong key-insulated signature schemes. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 130–144. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  20. 20.
    Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)Google Scholar
  21. 21.
    Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 548–566. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  22. 22.
    Goldwasser, S., Micali, S., Riverst, R.: A digital signature scheme secure against adaptive chosen message attacks. SIAM Journal of Computing 17(2), 281–308 (1988)MATHCrossRefGoogle Scholar
  23. 23.
    Guillou, L., Quisquater, J.-J.: A “paradoxical” identity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 216–231. Springer, Heidelberg (1990)Google Scholar
  24. 24.
    Heß, F.: Efficient identity based signature schemes based on pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310–324. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  25. 25.
    Kurosawa, K., Heng, S.-H.: Identity-based identification without random oracles. In: ISH 2005. LNCS. Springer, Heidelberg (2005) (to appear)Google Scholar
  26. 26.
    Libert, B., Quisquater, J.-J.: New identity based signcryption schemes from pairings. In: IEEE Information Theory Workshop, Paris, France (2003), http://eprint.iacr.org/2003/023
  27. 27.
    Malone-Lee, J.: Identity-based signcryption. Cryptology ePrint Archive, Report 2002/098 (2002), http://eprint.iacr.org/2002/098
  28. 28.
    McCullagh, N., Barreto, P.S.L.M.: Efficient and forward-secure identity-based signcryption. Cryptology ePrint Archive, Report 2004/117 (2004), http://eprint.iacr.org/2004/117
  29. 29.
    Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions on Fundamentals E84-A(5), 1234–1243 (2001)Google Scholar
  30. 30.
    Nalla, D., Reddy, K.C.: Signcryption scheme for identity-based cryptosystems. Cryptology ePrint Archive, Report 2003/066 (2003), http://eprint.iacr.org/2003/066
  31. 31.
    Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 387–398. Springer, Heidelberg (2001)Google Scholar
  32. 32.
    Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology 13(3), 361–396 (2000)MATHCrossRefGoogle Scholar
  33. 33.
    Sakai, R., Kasahara, M.: ID based cryptosystems with pairing on elliptic curve. In: SCIS 2003, Hamamatsu, Japan (2003), http://eprint.iacr.org/2003/054
  34. 34.
    Shamir, A.: Identity based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  35. 35.
    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
  36. 36.
    Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  37. 37.
    Yuen, T.H., Wei, V.K.: Fast and proven secure blind identity-based signcryption from pairings. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 305–322. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  38. 38.
    Zhang, F., Safavi-Naini, R., Susilo, W.: An efficient signature scheme from bilinear pairings and its applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  39. 39.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Paulo S. L. M. Barreto
    • 2
  • Benoît Libert
    • 3
  • Noel McCullagh
    • 1
  • Jean-Jacques Quisquater
    • 3
  1. 1.School of Computer ApplicationsDublin City UniversityBallymun, Dublin 9Ireland
  2. 2.PCS, Escola PolitécnicaUniversidade de São PauloSão Paulo(SP)Brazil
  3. 3.Microelectronics Laboratory, Crypto GroupUCLLouvain-La-NeuveBelgium

Personalised recommendations