Certificateless proxy signature scheme based on discrete logarithm problem

To solve the problems of certificate management or key escrow in proxy signature schemes, a new certificateless proxy signature scheme(CLPS) is presented. This scheme solves the key escrow problem by binding two partially private keys with a same identity and also satisfies all the required characteristics of the proxy signature. Its security is based on the discrete logarithm problem(DLP). It has existential unforgeability, effectively resisting the attack of Type-I adversary and Type-II adversary. Compared with the existed CLPS, the CLPS presented here doesn't use the bilinear pairing and its proxy keys use the Schnorr short signature, and its efficiency and security is improved.