Skip to main content
Springer Nature Link
Log in

ID-Based Aggregate Signatures from Bilinear Pairings

  • Conference paper
Cryptology and Network Security (CANS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3810))

Included in the following conference series:

Abstract

Aggregate signature scheme was recently proposed by Boneh, Gentry, Lynn and Shacham, which presented a method for combining n signatures from n different signers on n different messages into one signature. In this paper, we propose an identity-based aggregate signature scheme based on the bilinear pairings. This enhances the efficiency of communication and signature verification process. We show that the security of our scheme is tightly related to the computational Diffie-Hellman assumption in the random oracle model.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416–432. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  3. Maurer, U., Yacobi, Y.: Non-interective public-key cryptography. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 458–460. Springer, Heidelberg (1991)

    Google Scholar 

  4. Tsuji, S., Itoh, T.: An ID-based Cryptosystem based on the Discrete Logarithm Problem. IEEE Journal of Selected Areas in Communications 7, 467–473 (1989)

    Article  Google Scholar 

  5. 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 

  6. 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 

  7. Joux, A.: The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 20–32. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Kim, M.S., Kim, K.: A new identification scheme based on the bilinear Diffie-Hellman problem. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 464–481. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  10. Yi, X.: An Identity-Based Signature Scheme from the Weil Pairing. IEEE Communications Letters 7(2), 76–78 (2003)

    Article  Google Scholar 

  11. Barreto, P., Kim, H., 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)

    Chapter  Google Scholar 

  12. Cheon, J.H., Kim, Y., Yoon, H.J.: A New ID-Based Signature with Batch Verification, Available from http://eprint.iacr.org/2004/131

  13. Cramer, R., Shoup, V.: Signature Schemes Based on the Strong RSA Assumption. ACM Transactions on Information and System Security 3(3), 161–185 (2000)

    Article  Google Scholar 

  14. Gennaro, R., Halevi, S., Rabin, T.: Secure Hash-and-Sign Signatures without the Random Oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 123–139. Springer, Heidelberg (1999)

    Google Scholar 

  15. Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: 2000 Symposium on Cryptography and Information Security, Okinawa, Japan, pp. 26–28 (2000)

    Google Scholar 

  16. Libert, B., Quisquater, J.J.: The Exact Security of an Identity Based Signature and Its Applications, Available from http://eprint.iacr.org/2004/102

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Information Security, P.R. China

    Jing Xu, Zhenfeng Zhang & Dengguo Feng

  2. Graduate School of Chinese Academy of Sciences, Beijing, 100039, P.R. China

    Jing Xu

  3. Institute of Software, Chinese Academy of Sciences, Beijing, 100080, P.R. China

    Zhenfeng Zhang & Dengguo Feng

Authors
  1. Jing Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenfeng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dengguo Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University College London,  

    Yvo G. Desmedt

  2. Centre for Advanced Computing - Algorithms and Cryptography Department of Computing, Macquarie University, Australia

    Huaxiong Wang

  3. Centre for Computer and Information Security Research School of Computer Science and Software Engineering, University of Wollongong, Australia

    Yi Mu

  4. Fujian Normal University, 350007, Fuzhou, Fujian, China

    Yongqing Li

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, J., Zhang, Z., Feng, D. (2005). ID-Based Aggregate Signatures from Bilinear Pairings. In: Desmedt, Y.G., Wang, H., Mu, Y., Li, Y. (eds) Cryptology and Network Security. CANS 2005. Lecture Notes in Computer Science, vol 3810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599371_10

Download citation

  • DOI: https://doi.org/10.1007/11599371_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30849-2

  • Online ISBN: 978-3-540-32298-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation