JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16]


Journal of Information Science and Engineering, Vol. 32 No. 4, pp. 1097-1112


Efficient Multi-Proxy Signature Scheme with Short Length in the Standard Model


JIAN-HONG ZHANG1 AND JIAN MAO2 
1Institute of Image Processing and Pattern Recognition 
North China University of Technology 
Beijing, 100144 P.R. China 
E-mail: jhzhangs@163.com 
2Electronic and Information Engineering 
Beihang University 
Beijing, 10083 P.R. China 
E-mail: maojian@buaa.edu.cn


    As a signing capability delegation technique, multi-proxy signature allows all signers in the delegated group to produce jointly a multi-proxy signature on the behalf of an original signer, and has been widely applied in distributed computing. Currently, most of multi-proxy signature schemes in the standard model cannot achieve strong unforgeablity, lightweight computation and short length of multi-proxy signature. These problems restrict its application since many devices has limited computation capacity and storage space. In this work, a novel multi-proxy signature scheme with short length in the standard model is proposed. The scheme can not only achieve strong unforgeability, but also has short length of the signature. Compared with the other three multi-proxy signature schemes, the proposed scheme has the great advantages over the other three schemes. To the best of our knowledge, our proposed multi-proxy signature scheme is the first shortest size, whose signature length is only 320bits for a security level of 80 bits and the same length as that of DSA.


Keywords: strong unforgeability, short signature, multi-proxy signature, the computational Diffie-Hellman problem, efficiency

  Retrieve PDF document (JISE_201604_15.pdf)