A New Efficient Certificateless Short Signature Scheme Using Bilinear Pairings
- 4 November 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 11 (4), 2395-2402
- https://doi.org/10.1109/jsyst.2015.2490163
Abstract
Recently, the idea of a certificateless short signature (CLSS) scheme has been proposed, as a way of supporting applications or devices in low-bandwidth communication environments, as well as certain devices with limited storage capacity. However, most CLSS schemes have adopted an inefficient and probabilistic hash function, called MapToPoint, making them hard for the computer system designer to implement efficiently. This paper develops a new efficient CLSS scheme using bilinear pairings. The proposed CLSS scheme has the lowest computational cost of signature generation and signature verification, compared to all of the other CLSS schemes. The signature length of our CLSS scheme is only one group element, which means that it is impossible for any CLSS scheme to have a lower signature size than ours. In addition, the MapToPoint operation is not used in our CLSS scheme, so the proposed scheme can be implemented more easily. A formal security analysis is presented, showing that the proposed scheme is secure against both super type I and super type II adversaries. Hence, the proposed scheme is suitable for both limited storage and limited computing capacity devices in low-bandwidth communication environments.Keywords
This publication has 24 references indexed in Scilit:
- Efficient Proxy Signature Scheme for Mobile Devices from Bilinear PairingsInformation Technology And Control, 2013
- Strong non‐repudiation based on certificateless short signaturesIET Information Security, 2013
- Strongly secure certificateless short signaturesJournal of Systems and Software, 2012
- Weaknesses and improvements of an efficient certificateless signature scheme without using bilinear pairingsInternational Journal of Communication Systems, 2012
- An efficient and provably‐secure certificateless signature scheme without bilinear pairingsInternational Journal of Communication Systems, 2011
- A new provably secure certificateless short signature schemeComputers & Mathematics with Applications, 2011
- Efficient and short certificateless signatures secure against realistic adversariesThe Journal of Supercomputing, 2010
- Efficient and provably-secure certificateless short signature scheme from bilinear pairingsComputer Standards & Interfaces, 2009
- Breaking the short certificateless signature schemeInformation Sciences, 2009
- ID-based signatures from pairingson elliptic curvesElectronics Letters, 2002