A NOVEL EFFICIENT THRESHOLD PROXY SIGNATURE SCHEME

Since the first (t,n) threshold proxy signature scheme was proposed, the threshold proxy signature has enjoyed a considerable amount of interest from the cryptographic research community. But most of existing threshold proxy signature schemes were pointed out some weaknesses, which were vulnerable to the well-known attacks, such as frame attack, public-key substitute attack, warrant attack, collusion attack and so on. In this paper, we propose a novel threshold proxy signature scheme, which can resist the attacks as mentioned above. Furthermore, compared to existing threshold proxy signature schemes based on discrete logarithms, our scheme is more efficient than them.