Efficient and strongly unforgeable short signature scheme in standard model
1.Department of Mathematics, Xidian University, Xi′an, Shaanxi 710071, China; 2.State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China; 3.School of Telecommunication and Engineering, Xidian University, Xi′an, Shaanxi 710071, China; 4.School of Science, Xi′an Technological University, Xi′an, Shaanxi 710032, China
Abstract：To solve the low efficiency of existing strongly unforgeable signature schemes in standard model, a new efficient signature scheme was proposed. Based on the computational DiffieHellman (CDH) hard problem assumption of bilinear pairing on elliptic curves, the proposed scheme was proved to be strongly unforgeable. For the proposed scheme, the public key contains six group elements with a single group element of secret key, and the signature includes two group elements. There are three exponential computations in the signing algorithm with one exponential and two pairing computations in the verification stage. The results show that compared with the existing strongly unforgeable signature schemes in standard model, the new scheme has a shorter length of public\\secret key and signature with decreased computation time of signing and verification algorithms. The proposed scheme is suitable for the constrained resource communication environments with high efficiency.
刘振华, 胡予濮, 张襄松. 标准模型下高效的强不可伪造短签名方案[J]. 江苏大学学报（自然科学版）, 2013, 34(3): 309-313.
LIU Zhen-Hua, HU Yu-Pu, ZHANG Xiang-Song. Efficient and strongly unforgeable short signature scheme in standard model[J]. Journal of Jiangsu University(Natural Science Eidtion)
, 2013, 34(3): 309-313.
2013, Vol. 34 
