Skip to main content

Efficient ID-Based Signature Scheme from Bilinear Map

  • Conference paper
Advances in Parallel Distributed Computing (PDCTA 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 203))

  • 1623 Accesses

Abstract

We propose an identity (ID)-based signature scheme from bilinear map. The scheme is proved secure against existential forgery on adaptively chosen message and given ID attack in random oracle model under the Computational Diffie-Hellman (CDH) assumption. The new scheme is simple and computationally more efficient than other existing schemes. Furthermore, since the building blocks for proposed ID-based signature is the BLS short signature, hence in communications of ID-based signatures over low band width channels, the proposed scheme will be more economic and applicable.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. Barreto, P.S.L.M., Libert, B., McCullagh, N., et al.: Efficient and provably-secure identity-based signature and signcryption from bilinear maps. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 515–532. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. 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)

    Google Scholar 

  5. Cheng, X., Liu, J., Wang, X.: Identity-based aggregate and verifiably encrypted signatures from bilinear pairing. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3483, pp. 1046–1054. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Du, H., Wen, Q.: An efficient identity-based short signature scheme from bilinear pairings. In: International Conference on Computational Intelligence and Security, IEEE Explore, pp. 725–729 (2007)

    Google Scholar 

  7. Hesss, F.: Efficient identity based signature scheme based on pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310–324. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. E85-A(2), 481–484 (2002)

    Google Scholar 

  9. Paterson, K.G.: ID-based signatures from pairings on elliptic curves. IEEE Electronic Letters 38(18), 1025–1026 (2002)

    Article  Google Scholar 

  10. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology 13(3), 361–396 (2000)

    Article  MATH  Google Scholar 

  11. Shamir, A.: Identity based cryptosystem and signature scheme. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  12. Wang, Z., Chen, H.: A practical identity-based signature scheme from bilinear map. In: Denko, M.K., Shih, C.-s., Li, K.-C., Tsao, S.-L., Zeng, Q.-A., Park, S.H., Ko, Y.-B., Hung, S.-H., Park, J.-H. (eds.) EUC-WS 2007. LNCS, vol. 4809, pp. 704–715. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Yi, X.: An identity-based signature scheme from the Weil pairing. IEEE Communication Letters 7(2), 76–78 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sahu, R.A., Padhye, S. (2011). Efficient ID-Based Signature Scheme from Bilinear Map. In: Nagamalai, D., Renault, E., Dhanuskodi, M. (eds) Advances in Parallel Distributed Computing. PDCTA 2011. Communications in Computer and Information Science, vol 203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24037-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24037-9_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24036-2

  • Online ISBN: 978-3-642-24037-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics