Skip to main content
Springer Nature Link
Log in

Fast and Proven Secure Blind Identity-Based Signcryption from Pairings

  • Conference paper
Topics in Cryptology – CT-RSA 2005 (CT-RSA 2005)

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

Included in the following conference series:

Abstract

We present the first blind identity-based signcryption(BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability (p1m-uf). We present an efficient construction from pairings, then prove a security theorem that reduces its p1m-uf to Schnorr’s ROS Problem in the random oracle model plus the generic group and pairing model. The latter model is an extension of the generic group model to add support for pairings, which we introduce in this paper. In the process, we also introduce a new security model for (non-blind) identity-based signcryption (IBSC) which is a strengthening of Boyen’s. We construct the first IBSC scheme proven secure in the strengthened model which is also the fastest IBSC in this model or Boyen’s model. The shortcomings of several existing IBSC schemes in the strengthened model are shown.

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

    Chapter  Google Scholar 

  2. Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The one-more- RSA-inversion problem and the security of Chaums blind signature scheme. J. of Cryptology, 185–215 (2003)

    Google Scholar 

  3. Boldyreva, A.: Efficient threshold signature, multisignature, and blind signatureschemes based on the Gap-Diffie-Hellman-group signature scheme. In: Boley, H., Richter, M.M. (eds.) PDK 1991. LNCS, vol. 567, pp. 31–46. Springer, Heidelberg (1991)

    Google Scholar 

  4. Boneh, D., Franklin, M.: Identity-based encryption from the weil paring. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Boyen, X.: Multipurpose identity-based signcryption: A swiss army knife for identity-based cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 382–398. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  7. Chaum, D.: Blind signatures for untraceable payments. In: Proc. CRYPTO 1982, pp. 199–203. Plenum, New York (1983)

    Google Scholar 

  8. Chen, L., Malone-Lee, J.: Improved identity-based signcryption. CryptologyePrint Archive, Report 2004/114 (2004), http://eprint.iacr.org/

  9. Chow, S., Yiu, S.M., Hui, L., 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)

    Chapter  Google Scholar 

  10. Cocks, C.: Non-interactive public-key cryptography. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360–363. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Reddy, K.C., Nalla, D.: Signcryption scheme for identity-based cryptosystems. Cryptology ePrint Archive, Report 2003/066 (2003), http://eprint.iacr.org/

  12. Desmedt, Y., Quisquater, J.: Public-key systems based on the difficulty of tampering. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 111–117. Springer, Heidelberg (1987)

    Google Scholar 

  13. Libert, B., Quisquater, J.-J.: New identity based signcryption schemes from pairings. In: IEEE Information Theory Workshop, Paris, France (2003)

    Google Scholar 

  14. Libert, B., Quisquater, J.-J.: The exact security of an identity based signature and its applications. Cryptology ePrint Archive, Report 2004/102 (2004), http://eprint.iacr.org/

  15. Malone-Lee, J.: Identity-based signcryption. Cryptology ePrint Archive, Report 2002/098 (2002), http://eprint.iacr.org/

  16. Maurer, U., Yacobi, Y.: Non-interative public-key cryptography. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 498–507. Springer, Heidelberg (1991)

    Google Scholar 

  17. 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/

  18. Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, vol. 55, pp. 165–172 (1994)

    Google Scholar 

  19. Pointcheval, D.: Practical security in public-key cryptography. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 1–17. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Schnorr, C.P.: Security of blind discrete log signatures against interactive attacks. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol. 2229, pp. 1–12. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

  22. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256–266. Springer, Heidelberg (1997)

    Google Scholar 

  23. Tsuji, S., Itoh, T.: An ID-based cryptosystem based on the discrete logarithm problem. IEEE Journal on Selected Areas in Communication 7(4), 467–473 (1989)

    Article  Google Scholar 

  24. Zhang, F., Kim, K.: ID-based blind signature and ring signature from pairings. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 533–547. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  25. Zhang, F., Kim, K.: Efficient ID-based blind signature and proxy signature from bilinear pairings. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  26. Zhang, F., Safavi-Naini, R., Susilo, W.: Efficient verifiably encrypted signature and partially blind signature from bilinear pairings. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 191–204. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong

    Tsz Hon Yuen & Victor K. Wei

Authors
  1. Tsz Hon Yuen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor K. Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Combinatorics & Optimization, University of Waterloo,  

    Alfred Menezes

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yuen, T.H., Wei, V.K. (2005). Fast and Proven Secure Blind Identity-Based Signcryption from Pairings. In: Menezes, A. (eds) Topics in Cryptology – CT-RSA 2005. CT-RSA 2005. Lecture Notes in Computer Science, vol 3376. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30574-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30574-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24399-1

  • Online ISBN: 978-3-540-30574-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy