an efficient pairing-free identity based proxy blind signature scheme with message recovery

In recent years, due to their potential applications, proxy blind signaturesbecame an active research topic and are an extension of the basic proxysignature. a proxy blind signature scheme enables a proxy signer to produce ablind signature on behalf of an original signer. such schemes are useful in manypractical applications such as e-commerce, e-voting, e-tendering systems. manyproxy blind signature schemes have been proposed in the literature. in order toimprove the efficiency and to adopt resource constrained devices, in this paper,we propose a pairing free id-based proxy blind signature scheme with messagerecovery. the proposed scheme is proven secure against the random oraclemodel under the hardness assumption of the elliptic curve discrete logarithmproblem. we compare our scheme with the other proxy blind signature schemes.the efficiency analysis shows that our scheme is more efficient in terms ofcomputational and communicational point of view. also due to the messagerecovery property, our scheme can be deployed easily in low band width devices