Open AccessEfficient identity‐based blind message recovery signature scheme from pairings
Author(s) -
Verma Girraj Kumar,
Singh B.B.
Publication year - 2018
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2017.0342
Subject(s) - scheme (mathematics) , blind signature , ring signature , computer science , identity (music) , signature (topology) , elgamal signature scheme , theoretical computer science , computer security , digital signature , mathematics , physics , geometry , acoustics , hash function , mathematical analysis
Blind signature (BS) schemes are a vital tool to design electronic cash (e‐cash), online transaction, electronic voting (e‐voting), digital right management (DRM) systems etc. The communication systems designed for such applications need small size and more confidential signature schemes. This article presents the first provably secure and efficient identity‐based message recovery BS scheme from pairing. Since, in this scheme, the message is not transmitted with signature and recovered during verification phase, the total message–signature length is the lowest. Due to the blindness, the scheme provides authentication along with anonymity. The performance comparison shows that the authors' scheme consumes the lowest computation cost. Thus, it inspires the energy efficient (green) technology as well as is the most appealing BS scheme towards applications such as e‐cash, e‐voting, DRM systems etc. using low bandwidth and high security.