Efficient ID-based threshold proxy signature in standard model

At present,the security of the identity based threshold proxy signature schemes is almost proven in the random oracle model,but for which any implementation of the random oracle results in insecure schemes.It is more practical to design threshold proxy signature scheme in the standard model,compared with the existing ones.This paper presented a secure and efficient ID-based threshold proxy signature scheme(IBTPS) in the standard model.The scheme's correctness was exactly proven in terms of bilinear pairing technique and given its security analysis and prove in detail in the assumption of the computational Diffie-Hellman problem.The verification of signature only needs 4 bilinear pairing operations,so the scheme is very efficient.