Efficient Proxy Signature Scheme for Mobile Devices from Bilinear Pairings
Keywords: proxy signature, bilinear pairings, chosen message attack, random oracle
AbstractA proxy signature scheme is useful and convenient because it allows a proxy signer to sign a message on behalf of an entity. This study proposes a novel efficient proxy signature scheme for mobile devices using bilinear pairings. The computational cost of the proposed signature scheme is extremely low, and the length of the proposed signature is limited. In addition, our scheme does not require a special hash function, namely the Map-To-Point hash function. We also show that the proposed scheme is secure against adaptive chosen message attacks under a random oracle.
Copyright terms are indicated in the Republic of Lithuania Law on Copyright and Related Rights, Articles 4-37.