Abstract
Short digital signatures are essential to ensure the authenticity of messages in low-bandwidth communication channels and are used to reduce the communication complexity of any transmission. A new short signature scheme based on the bilinear pairing in the standard model is introduced. The proposed scheme has short public parameters and the size of the signature achieves 160 bits. In addition, under the n-Exponent Computational Diffie-Hellman Problem(n-CDH), the new scheme is provable security. To the best of authors knowledge, this is the first scheme whose signature size achieves 160 bits based on the bilinear pairing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communication Security, pp. 390–398 (2006)
Barr, K., Asanovic, K.: Energy aware lossless data compression. In: Proceedings of the ACM Conference on Mobile Systems, Applications and Services (2003)
Tso, R., Okamoto, T.: Efficient Short Signatures from Pairing. In: 2009 Sixth International Conference on Information Technology: New Generations, pp. 417–422. IEEE Press, New York (2009)
Zhang, F., Chen, X., Susilo, W., Mu, Y.: A new short signature scheme without random oracles from bilinear pairings, Cryptology ePrint Archive, Report 2005/386 (2005), http://eprint.iacr.org/2005/386.pdf
Tso, R., Gu, C., Okamoto, T., Okamoto, E.: Efficient ID-based digital signatures with message recovery. In: Bao, F., Ling, S., Okamoto, T., Wang, H., Xing, C. (eds.) CANS 2007. LNCS, vol. 4856, pp. 47–59. Springer, Heidelberg (2007)
Zhang, F., Susilo, W., Mu, Y.: Identity-based partial message recovery signatures (or How to shorten IDbased signatures). In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol. 3570, pp. 45–56. Springer, Heidelberg (2005)
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)
Gennaro, R., Halevi, S., Rabin, T.: Secure hash-and-sign signature without the random oracle. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 123–139. Springer, Heidelberg (1999)
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)
Wei, V.K., Yuen, T.H.: More Short Signatures without Random Oracles.Cryptology ePrint Archive: Report 2005/463
Zhang, F., Safavi-Naini, R., Susilo, W.: An efficient signature scheme form bilinear pairing and its application. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)
Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosenmessage attacks. SIAM J. Comput. 17(2), 281–308 (1988)
Du, H., Wen, Q.: Efficient and provably-secure certificateless short signature scheme from bilinear pairings. Computer Standards and Interfaces 31, 390–394 (2009)
Shao, Z.: A provably secure short signature scheme based on discrete logarithms. Information Sciences 177, 5432–5440 (2007)
Kang, L., Tang, X., Lu, X.: A Short Signature Scheme in the Standard Model. Cryptology ePrint Archive, Report 2007/398 (2007), http://eprint.iacr.org/2007/398.pdf
Zhang, F., Chen, X., Mu, Y.: A new and efficient signature on commitment values. International Journal of Network Security 7(1), 100–105 (2008)
Zhang, M., Yang, B., Zhong, Y.: Cryptanalysis and Fixed of Short Signature Scheme without Random Oracle from Bilinear Parings. International Journal of Network Security 12(2), 159–165 (2011) (Will appear)
Guo, F., Mu, Y., Chen, Z.: Efficient batch verification of short signatures for a single-signer setting without random oracles. In: Matsuura, K., Fujisaki, E. (eds.) IWSEC 2008. LNCS, vol. 5312, pp. 49–63. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, L., Hu, Y., Wu, Q. (2010). Short Signature from the Bilinear Pairing. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Lecture Notes in Computer Science, vol 6377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16167-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-16167-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16166-7
Online ISBN: 978-3-642-16167-4
eBook Packages: Computer ScienceComputer Science (R0)