An Efficient Identity-Based Short Signature Scheme from Bilinear Pairings
In this paper, we present an ID-based signature scheme that is proved to be secure in the random oracle model under the hardness assumption of k-CAA problem. The proposed scheme upholds all desirable properties of previous IBS schemes, and requires general cryptographic hash functions instead of MapToPoint hash function that is inefficient and probabilistic. Furthermore, our scheme requires less computation cost and is significantly more efficient than all known IBS schemes, and the size of signatures generated by our scheme is approximate 160 bits, which is the shortest ID-based signatures so far.