Title: Practical certificateless short signature scheme

Authors: Miaomiao Tian; Liusheng Huang; Wei Yang

Addresses: School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China; Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, China ' School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China; Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, China ' School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China; Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou 215123, China

Abstract: Certificateless cryptography is an attractive paradigm for public key cryptography since it does not require certificates in traditional public key cryptography and also solves the inherent key escrow problem in identity-based cryptography. Currently, certificateless short signature is receiving significant attention from the public key cryptography research community as it is particularly useful in low-bandwidth communication environments. However, most of the certificateless short signature schemes only support low-level security. Recently, Choi et al. presented a certificateless short signature scheme and claimed that it is provably secure against super adversaries in the random oracle model. Unfortunately, in this paper, we show that their scheme is insecure even against a strong adversary. We then propose a new certificateless short signature scheme and prove that it is secure against strong adversaries. Compared with other certificateless short signature schemes, our scheme is more computationally efficient.

Keywords: certificateless cryptography; certificateless short signature; bilinear pairing; efficiency; public key cryptography; security.

DOI: 10.1504/IJESDF.2014.064409

International Journal of Electronic Security and Digital Forensics, 2014 Vol.6 No.3, pp.204 - 218

Received: 25 Feb 2014
Accepted: 13 May 2014
Published online: 30 Aug 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article