A note on 'An efficient certificateless aggregate signature with constant pairing computations'

A note on ‘An efficient certificateless aggregate signature with constant pairing computations’ Jianhua Chen, Debiao He, Miaomiao Tian 1 School of Mathematics and Statistics, Wuhan University, Wuhan, China 2 School of Computer Science and Technology, University of Science and Technology of China, Hefei, China *Email: hedebiao@163.com Abstract: Recently, Xiong et al. 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.