z-logo
Premium
A short ID‐based proxy signature scheme
Author(s) -
Asaar Maryam Rajabzadeh,
Salmasizadeh Mahmoud,
Susilo Willy
Publication year - 2014
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.2820
Subject(s) - random oracle , computer science , proxy (statistics) , computer security , scheme (mathematics) , identity (music) , overhead (engineering) , theoretical computer science , computer network , algorithm , public key cryptography , mathematics , encryption , programming language , mathematical analysis , machine learning , physics , acoustics
Summary The notion of identity‐based proxy signature with message recovery feature has been proposed to shorten identity‐based proxy signatures and improve their communication overhead because signed messages are not transmitted with these kinds of signatures. There are a few schemes for this notion: the schemes of Singh and Verma and Yoon et al . Unfortunately, Tian et al ., by presenting two forgery attacks, show that Singh and Verma scheme is not secure, and also, the scheme of Yoon et al . does not support provable security. The contributions of this paper are twofold. First, we review the scheme by Yoon et al. and discuss why it does not have message recovery property, and consequently, it is not short. Second, we propose a short identity‐based proxy signature scheme with the help of message recovery property and show that it is secure under computational Diffie–Hellman assumption in the random oracle model. Furthermore, our scheme is more efficient than (as efficient as) previous identity‐based proxy signatures. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here