Identity-Based Digital Signature Scheme Without Bilinear Pairings
Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, the authors propose an identity based signature scheme without bilinear pairings. With both the running time and the size of the signature being saved greatly, the scheme is more practical than the previous related schemes for practical application.