Provably Secure Identity Based Threshold Signature Withoutrandom Oracles

Recently, Paterson and Schuldt proposed an Identity-based (ID-based) signature scheme which is provably secure in the absence of random oracles. In this paper, we propose an ID-based threshold signature scheme based on their signature scheme. The proposed construction is proved secure in the standard model and its security rests on the hardness of discrete log assumption along with the computational Diffe-Hellman problem. To the best of our knowledge, previous-related schemes could only be proved secure in the random oracle model.