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


Journal of Information Science and Engineering, Vol. 27 No. 4, pp. 1249-1264 (July 2011)

Another Efficient Proxy Signature Scheme in the Standard Model*

Institute of Image Processing and Pattern Recognition
North China University of Technology
Beijing, 100144 P.R. China
+School of Electronic and Information Engineering
Beihang University
Beijing, 10083 P.R. China

As an important delegation technology, proxy signature allows an original signer to delegate her signing capability to a proxy signer and the proxy signer can produce a signature on behalf of the original signer. At present, the length of proxy signature is a sum of lengths of two signatures in most of proxy signature schemes. It limits some applications for proxy signature. In this paper, we propose an efficient short proxy signature scheme without random oracle model based on Zhang et al.'s signature scheme. And the scheme is proven secure in the standard model and the security of the scheme is related to the k + 1-Square Roots Assumption. Compared with Huang et al.'s scheme, our scheme has several advantages over Huang et al.'s scheme in terms of the size of public key and computational costs of generation and verification of proxy signature. It is very suitable for mobile device.

Keywords: mobile agent, proxy signature, the k + 1-square roots problem, security proof, standard model

Full Text () Retrieve PDF document (201107_04.pdf)

Received March 31, 2010; revised July 26, 2010; accepted September 16, 2010.
Communicated by Wen-Guey Tzeng.
* This paper was supported by Natural Science Foundation of China (No. 60703044), the New Star Plan Project of Beijing Science and Technology (No. 2007B001), and The Beijing Natural Science Foundation Program and Scientific Research Key Program of Beijing Municipal Commission of Education (No. KZ200810009005).