Certificateless Short Signature Scheme from Bilinear Pairings

Abstract:

Certificateless short signature schemes can not only have the advantage of certificateless signature, but also provide a short signature size in communication. However, all existing certificateless short signature schemes only proven secure against a normal adversary which can only obtain the valid signature for the original public key rather than a super adversary which can obtain the valid signature for the replaced public key. Recently, Fan et al. proposed a certificateless short signature scheme which is very efficient, but we found it is still cannot against super adversary. In this paper, we first analysis their scheme, and then present an improved scheme which can against super adversaries. Furthermore, our scheme can provide both the strongest security level and the shortest signature size compared the existed provably secure certificateless short signature scheme.

• Periodical: Applied Mechanics and Materials (Volumes 380-384)
• Pages: 2435-2438
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.380-384.2435
• Online since: August 2013
• Authors: Shu Rong Feng, Jiao Mo, Hua Zhang, Zheng Ping Jin
• Keywords: Bilinear Pairing, Certificateless Short Signature, Super Adversary

References

[1] S. Al-Riyami, K. Paterson, Certificateless public key cryptography, in: Proceedings of the Asiacrypt 2003, Taipei, Taiwan, 2003, p.452–473.

DOI: 10.1007/978-3-540-40061-5_29

[2] A . Shamir, Identity-based cryptosystems and signature schemes, Proc. Crypto'84, Santa Barbara, CA , Aug. 1984, p.47–53.

[3] D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil pairing, in: C. Boyd(Ed. ), Advances in Cryptology-Asiacrypt 2001, LNCS, vol. 2248, Springer-Verlag, 2001, p.514–532.

DOI: 10.1007/3-540-45682-1_30

[4] Huang, X., Mu, Y., Susilo, W., Wong, D.S., Wu, W., 2007. Certificateless signature revisited. Proceedings of ACISP'07. Lecture Notes in Computer Science 4586, 308–322.

DOI: 10.1007/978-3-540-73458-1_23

[5] H. Du and Q. Wen, Efficient and provably-secure certificateless short signature scheme from bilinear pairings, Computer Standards and Interfaces 31(2009)390–394.

DOI: 10.1016/j.csi.2008.05.013

[6] K. Choi, J. Park, D. Lee, A new provably secure certificateless short signature scheme, Computers and Mathematics with Applications 61(2011)1760-1768.

DOI: 10.1016/j.camwa.2011.02.003

[7] CHUN-I FAN, RUEI-HAU HSU and PEI-HSIU HO, Truly Non-Repudiation Certificateless Short Signature Scheme from Bilinear Pairings, Journal of Information Science and Engineering 27, 969-982(2011).