An ID-based signature scheme from bilinear pairing based on k-plus problem

An ID-based cryptosystem enables the user to use public keys without exchanging public key certificates. In this scheme, users can use their identity to generate their public and private keys. The notion of bilinear pairing makes the system easy and efficient providing specific securities. In this paper, we have proposed an ID-based signature scheme from bilinear pairing based on k-plus problem. We show that the proposed scheme is existential unforgeable in the random oracle model under the inverse CDHP assumption. Our scheme is computationally more efficient than other existing schemes.