z-logo
open-access-imgOpen Access
A short certificateless aggregate signature against coalition attacks
Author(s) -
Xiaodong Yang,
Jinli Wang,
Tao Ma,
Yutong Li,
Caifen Wang
Publication year - 2018
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0205453
Subject(s) - random oracle , overhead (engineering) , signature (topology) , computer science , scheme (mathematics) , cryptosystem , aggregate (composite) , schnorr signature , elgamal signature scheme , computer security , digital signature , oracle , theoretical computer science , blind signature , cryptography , public key cryptography , mathematics , hash function , encryption , materials science , geometry , composite material , software engineering , mathematical analysis , operating system
Certificateless aggregate signature (CLAS) is a crucial cryptosystem. It can not only compress multiple signatures into a short signature, but also ensure the validity of each signature participating in the aggregation by verifying the validity of an resulting aggregate signature. Therefore, a secure and efficient CLAS scheme is very useful for resource-constrained environments because it greatly reduces the overall length of the signature and the verifier’s computational overhead. Cheng et al. presented an efficient CLAS scheme and proved its security in the random oracle model. However, we find that their scheme has security flaws. In this paper, we demonstrate that Cheng et al.’s CLAS scheme is vulnerable to coalition attacks from internal signers. To overcome these attacks, we present an improved CLAS scheme and prove that it is existentially unforgeable under the computational Diffie-Hellman assumption. In addition, our CLAS scheme can not only resist coalition attacks but also generate a very short aggregate signature. The performance analysis results show that our improved CLAS scheme is lower than the related CLAS schemes in terms of communication overhead and computation cost.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here