Efficient Pairing‐Based Threshold Proxy Signature Scheme with Known Signers.

Since threshold proxy signature has been proposed, all threshold proxy signature schemes are based on the discrete logarithm problems in the modular multiplicative group which has an element g with a large prime order. Nowadays this kind of threshold proxy signature schemes become more and more complex and time‐consuming for security and specific requirement. In this paper, we propose a (bilinear) pairing‐based threshold proxy signature scheme with known signers, analyze its security and check the following properties the proposed scheme has: non‐repudiation, unforgeability, identifiability, distinguishability, verifiability, prevention of misuse of proxy signing right, etc. Moreover, we point out that the proposed scheme is of great efficiency by comparing it with Sun's and Hsu et al.'s scheme. [ABSTRACT FROM AUTHOR]