Efficient ID-Based Signature Scheme from Bilinear Map

We propose an identity (ID)-based signature scheme from bilinear map. The scheme is proved secure against existential forgery on adaptively chosen message and given ID attack in random oracle model under the Computational Diffie-Hellman (CDH) assumption. The new scheme is simple and computationally more efficient than other existing schemes. Furthermore, since the building blocks for proposed ID-based signature is the BLS short signature, hence in communications of ID-based signatures over low band width channels, the proposed scheme will be more economic and applicable.