Email this article New Constructions of Short Signatures in the Standard Model
Abstract
To meet the needs in low-bandwidth communication, low-storage and less computation environments, a new technique is introduced to construct short signature in the standard model. The new short signature scheme is constructed based on the bilinear pairing and has short public parameters. In addition, the size of the signature achieves 160 bits. Under the n-Exponent Computational Diffie-Hellman Problem(n-CDH), the new scheme is provable security. Finally, we also give the application of the new scheme by constructing the short identity-based signature and threshold signatures.
Keywords
References
M. Bellare, G. Neven. “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.
K. Barr, K. Asanovic. “Energy aware lossless data compression”. In proceedings of the ACM Conference on Mobile Systems, Applications, and Services, 2003.
R. Tso, T.Okamoto. “Efficient Short Signatures from Pairing”. In: 2009 Sixth International Conference on Information Technology: New Generations. pp. 417-422, IEEE Press, New York, 2009.
F. Zhang, X. Chen, W.Susilo, and Y. Mu. “A new short signature scheme without random oracles from bilinear pairings”. Cryptology ePrint Archive, Report 2005/386, 2005. Available at http://eprint.iacr.org/2005/386.pdf
R. Tso, C. Gu, T. Okamoto and E. Okamoto. “Efficient ID-based digital signatures with message recovery”. In Proceedings of the 6th international conference on cryptology and network security (CANS 2007), Lecture Notes in Computer Science 4586, pp.47-59, 2007.
http://dx.doi.org/10.1007/978-3-540-76969-9_4
F. Zhang, W.Susilo, and Y. Mu. “Identity-based partial message recovery signatures (or How to shorten IDbased signatures)”. FC’05, Lecture Notes in Computer Science 3570, pp.45-56, 2005.
http://dx.doi.org/10.1007/11507840_5
D. Boneh, B. Lynn and H. Shacham. “Short signatures from the Weil pairing”. Advances in cryptology –CRYPTO’01, Lecture Notes in Computer Science 2248, 514-532, 2001.
http://dx.doi.org/10.1007/3-540-45682-1_30
R. Gennaro, S. Halevi and T. Rabin, Secure hash-and-sign signature without the random oracle, Advances in Cryptology-Eurocrypt 1999, LNCS 1592, pp.123-139, Springer-Verlag, 1999.
D. Boneh and X. Boyen. “Short signatures without random oracles.” Advances in Cryptology-Eurocrypt 2004, LNCS 3027, pp.56-73, Springer-Verlag, 2004. V. K. Wei and T. Hon Yuen. “More Short Signatures without Random Oracles.” Cryptology ePrint Archive: Report 2005/463.
F. Zhang, R. Safavi-Naini and W. Susilo. “An efficient signature scheme form bilinear pairing and its application.” PKC’04, Lecture Notes in Computer Science 2947, 277-290, 2004.
http://dx.doi.org/10.1007/978-3-540-24632-9_20
S. Goldwasser, S. Micali, and R. Rivest. “A digital signature scheme secure against adaptive chosen message attacks”. SIAM J. Comput., 17(2):281-308, 1988.
http://dx.doi.org/10.1137/0217017
H. Du, Q. Wen. “Efficient and provably-secure certificateless short signature scheme from bilinear pairings.” Computer Standards and Interfaces, 31: 390-394, 2009.
http://dx.doi.org/10.1016/j.csi.2008.05.013
Z. Shao. “A provably secure short signature scheme based on discrete logarithms”. Information Sciences, 177:5432-5440, 2007.
http://dx.doi.org/10.1016/j.ins.2007.05.039
L. Kang, X. Tang and X. Lu. “A Short Signature Scheme in the Standard Model”. Cryptology ePrint Archive, Report 2007/398, 2007. Available at http://eprint.i acr.org/2007/398.pdf.
F. Zhang, X. Chen and Y. Mu. “A new and efficient signature on commitment values”. International Journal of Network Security, 7(1), pp. 100-105, 2008.
M. Zhang, B. Yang and Y. Zhong. “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)
F. Guo, Y. Mu and Z. Chen. “Efficient batch verification of short signatures for a single-signer setting without random oracles”. Advances in Information and Computer Security, LNCS 5312,pp. 49-63, Springer-Verlag, 2008.
http://dx.doi.org/10.1007/978-3-540-89598-5_4
K. G. Paterson, J. C. N. Schuldt. “Efficient identity-based signatures secure in the standard”. ACISP 2006, LNCS 4058, pp. 207-222,Springer-Verlag, 2006.
X. Ch, J. M. Liu and X. M. Wang. “An Identity-Based Signature and It s Threshold Version”. Proceedings of the 19th International Conference on Advanced Information Networking and Applications(AINA'05). Washington : IEEE Computer Society, pp. 973-977, 2005.
X. F. Chen, F. G. Zhang. “New ID-based Threshold Signature Scheme from Bilinear Pairings”. INDOCRYPT 2004, LNCS 3348. Berlin: Springer-Verlag, pp. 371-383, 2004.
http://dx.doi.org/10.1007/978-3-540-30556-9_29
H. Wang, Y. Q. Zhang and D. G. Feng. “Short Threshold Signature Schemes without Random Oracles.” Advances in Cryptology-Docrypt 2005, Lectures Notes in Computer Science 3797. Berlin: Springer-Verlag, pp. 297-310, 2005.
R. Gennaro, S. Jarecki. “Robust Threshold DSS Signatures.” Advances in Cryptology-ROCRYPT 1996, Lectures Notes in Computer Science 1070. Berlin: Springer2Verlag,pp. 354-371, 1996.
H. Xiong, Z. Qin, and F. Li. “Identity-based Threshold Signature Secure in the Standard Model”. International Journal of Network Security, Vol.10, No.1, PP.75-80(2010).
Z. Wang, H. Qian and Z. Li. “Adaptively Secure Threshold Signature Scheme in the Standard Model”. Informatic, 2009, Vol. 20, No. 4, pp. 591-612, 2009.
L.Y. Zhang, Y. P. Hu and Z. Liu. “Provable secure ID-based threshold signature scheme without random oracles”. Journal of Xidian University, Vol. 35, No. 1, pp. 81-86, 2008.
Full Text: PDF