Premium
Provable secure proxy signature scheme without bilinear pairings
Author(s) -
Tiwari Namita,
Padhye Sahadeo
Publication year - 2013
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.1367
Subject(s) - random oracle , discrete logarithm , computer science , proxy (statistics) , schnorr signature , delegate , digital signature , bilinear interpolation , scalar multiplication , elgamal signature scheme , merkle signature scheme , cryptography , elliptic curve , provable security , elliptic curve cryptography , computer security , theoretical computer science , public key cryptography , blind signature , mathematics , encryption , hash function , machine learning , computer vision , programming language , mathematical analysis
SUMMARY 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 & Sons, Ltd.