Issue No. 06 - November/December (2003 vol. 15)
Min-Shiang Hwang , IEEE
<p><b>Abstract</b>—In a <tmath>(t,n)</tmath> threshold proxy signature scheme, the original signer delegates the power of signing messages to a designated proxy group of <tmath>n</tmath> members. Any <tmath>t</tmath> or more proxy signers of the group can cooperatively issue a proxy signature on behalf of the original signer, but <tmath>(t-1)</tmath> or less proxy signers cannot. Previously, all of the proposed threshold proxy signature schemes have been based on the discrete logarithm problem and do not satisfy all proxy requirements. In this paper, we propose a practical, efficient, and secure <tmath>(t,n)</tmath> threshold proxy signature scheme based on the RSA cryptosystem. Our scheme satisfies all proxy requirements and uses only a simple Lagrange formula to share the proxy signature key. Furthermore, our scheme requires only 5 percent of the computational overhead and 8 percent of the communicational overhead required in Kim's scheme.</p>
Lagrange interpolating polynomial, RSA cryptosystem, threshold proxy signature.
I. Lin, M. Hwang and E. J. Lu, "A Practical (t, n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem," in IEEE Transactions on Knowledge & Data Engineering, vol. 15, no. , pp. 1552-1560, 2003.