Paper 2012/445
A note on ‘An efficient certificateless aggregate signature with constant pairing computations’
Debiao He, Jianhua Chen, and Miaomiao Tian
Abstract
Recently, Xiong et al. [H. Xiong, Z. Guan, Z. Chen, F. Li, An efficient certificateless aggregate signature with constant pairing computations, Information Science, 219, pp. 225–235, 2013] proposed an efficient certificateless signature (CLS) scheme and used it to construct a certificateless aggregate signature (CLAS) scheme with constant pairing computations. They also demonstrated that both of the two schemes are provably secure in the random oracle model under the computational Diffie-Hellman assumption. Unfortunately, by giving concrete attacks, we point out that Xiong et al.’s schemes are not secure in their security model.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. The paper has been published.
- Keywords
- Certificateless cryptographyAggregate signatureBilinear pairing
- Contact author(s)
- hedebiao @ 163 com
- History
- 2013-03-16: last of 2 revisions
- 2012-08-06: received
- See all versions
- Short URL
- https://ia.cr/2012/445
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/445,
author = {Debiao He and Jianhua Chen and Miaomiao Tian},
title = {A note on ‘An efficient certificateless aggregate signature with constant pairing computations’},
howpublished = {Cryptology {ePrint} Archive, Paper 2012/445},
year = {2012},
url = {https://eprint.iacr.org/2012/445}
}