Abstract
The proxy signature schemes allow proxy signers to sign messages on behalf of an original signer, a company, or an organization. Such schemes have been suggested for use in a number of applications, particularly in distributed computing, where delegation of rights is quite common. Many identity-based proxy signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, in this letter, we propose an identity-based signature scheme without bilinear pairings. With the running time being saved greatly, our scheme is more practical than the previous related schemes for practical application.
Similar content being viewed by others
References
Shamir A (1984) Identity-based cryptosystems and signature schemes. In: Proceedings of CRYPTO 1984. Lecture Notes in Computer Science. vol 196, pp. 47–53
Mambo M, Usuda K, Okamoto E (1996) Proxy signature: delegation of the power to sign messages. IEICE Trans Fundamentals E79-A(9):1338–1353
Cha JC, Cheon JH (2002) An identity-based signature from gap Diffie-Hellman groups. In: Desmedt YG (ed) PKC 2003. LNCS. vol 2567. Springer, Heidelberg, pp 18–30
Hess F (2003) Efficient identity based signature schemes based on pairings. In: Nyberg K, Heys HM (eds) SAC 2002. LNCS, vol 2595. Springer, Heidelberg, pp 310–324
Barreto PSLM, Libert B, McCullagh N, Quisquater J (2005) Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. In: Roy B (ed) ASIACRYPT 2005. LNCS, vol 3788. Springer, Heidelberg, pp 515–532
Gu C, Zhu Y (2005) Provable security of ID-based proxy signature schemes. In: Lu X, Zhao W (eds) ICCNMC 2005. LNCS, vol 3619. Springer, Heidelberg, pp 1277–1286
Zhang J, Zou W (2007) Another ID-based proxy signature scheme and its extension. Wuhan Univ J Nat Sci 12:133–136
Wu W, Mu Y, Susilo W et al. (2007) Identity-based proxy signature from pairings, ATC 2007, LNCS 4610, pp. 22–31.
Gu C, Zhu Y (2008) An efficient ID-based proxy signature scheme from pairings. Inscrypt 2007, LNCS 4990, pp. 40–50
Ji H, Han W, Zhao L et al (2009) An identity-based proxy signature from bilinear pairings, 2009 WASE International Conference on Information Engineering, pp 14–17
Chen L, Cheng Z, Smart NP (2007) Identity-based key agreement protocols from pairings. Int J Inf Secur (6):213–241.
David P, Jacque S (2000) Security arguments for digital signatures and blind signatures. J Cryptol 13(3):361–396
Shamus Software Ltd., Miracl library, http://www.shamus.ie/index.php?page=home
The Certicom Corporation, SEC 2: Recommended Elliptic Curve Domain Parameters, www.secg.org/collateral/sec2_final.pdf
Cao X, Kou W, Du X (2010) A pairing-free identity-based authenticated key agreement protocol with, minimal message exchanges. Inf Sci 180:2895–2903
He D, Chen J, Hu J. An ID-based client authentication with key agreement protocol for mobile client-server environment on ECC with provable security, Information Fussion, doi:10.1016/j.inffus.2011.01.001.
Acknowledgments
The authors thank the anonymous reviewers and Dr. Guy Pujolle for their valuable comments. This research was supported by the Fundamental Research Funds for the Central Universities under Grants 201275786.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Debiao, H., Jianhua, C. & Jin, H. An ID-based proxy signature schemes without bilinear pairings. Ann. Telecommun. 66, 657–662 (2011). https://doi.org/10.1007/s12243-011-0244-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12243-011-0244-0