An Efficient Signature Scheme Based on Tate Pairing

The Weil and Tate pairings have found several new applications in cryptography. A new identity-based signature scheme is presented in the paper. In the signature scheme, the signing process doesn´t need to compute Tate pairing, so the efficiency of the signature scheme is higher than other identity-based signature scheme. Moreover, a new Implementation algorithm for computing Tate pairing is given in the paper, which is faster than Miller´s algorithm that is the best-known general methods. Finally, the security of the signature scheme is analyzed.