Provable secure proxy signature scheme without bilinear pairings. (16th November 2011)

• Record Type: Journal Article
• Authors: Tiwari, Namita; Padhye, Sahadeo
• Is Part Of: International journal of communication systems. Volume 26:Number 5(2013:May)
• Page Start: 644
• Page End: 650
• Publication Date: 2011-11-16
• Subjects: Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.1367
• Languages: English
• ISSNs: 1074-5351

Abstract

<abstract abstract-type="main" id="dac1367-abs-0001"> <title>SUMMARY</title> <p id="dac1367-para-0003">Proxy signature is an active research area in cryptography. A proxy signature scheme allows an entity to delegate his or her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Many proxy signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is more than 10 times of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, we propose a proxy signature scheme without bilinear pairings and prove its security against adaptive chosen‐message attack in random oracle model. The security of our scheme is based on the hardness of the elliptic curve discrete logarithm problem. With the running time being saved greatly, our scheme is more practical than the previous related scheme for practical applications. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p> </abstract>