An efficient and provably secure certificateless short signature scheme

DOI

10.2991/iccsee.2013.133How to use a DOI?

Keywords

Random oracle, Certificateless signature, Short signature, Bilinear pairing.

Abstract

Certificateless short signature can not only have the advantage of certificateless signature, but also provide a short signature size in communication. However , all existing certificateless short signature scheme only proven secure against a normal adversary which can only obtain the valid signatures for the original public key rather than a super adversary which can obtain the valid signatures for the replaced public key. In order to solve the problem, so in this paper, we proposed an efficient and provably secure certificateless short signature scheme which can be proved that it is secure against super adversaries in the random oracle model under the computational Diffie-Hellman (CDH) assumption. Furthermore, our scheme can provide both the strongest security level and the shortest signature size compared the existed provably secure certificateless short signature scheme.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Shu-Rong Feng
AU  - Jiao Mo
AU  - Hua Zhang
AU  - Zheng-Ping Jin
PY  - 2013/03
DA  - 2013/03
TI  - An efficient and provably secure certificateless short signature scheme
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 519
EP  - 522
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.133
DO  - 10.2991/iccsee.2013.133
ID  - Feng2013/03
ER  -