Cryptanalysis and Improvement of Three Certificateless Aggregate Signature Schemes. (23rd August 2018)

• Record Type: Journal Article
• Authors: Yang, Xiaodong; Li, Yutong; Chen, Chunlin; Xiao, Likun; Wang, Caifen
• Other Names: Islam Nazrul Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2018(2018)
• Publication Date: 2018-08-23
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2018/1908632
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : The certificateless aggregate signature (CLAS) scheme is a very important data aggregation technique that compresses a large number of signatures from different users into a short signature. CLAS can reduce the total length of a signature and the computational overhead of signature verification and is therefore highly suitable for resource-constrained network environments. Many CLAS schemes have been proposed in recent years, but the construction of a secure and efficient CLAS scheme remains important. In 2018, Li et al. found that the CLAS scheme proposed by He et al. could not resist malicious-but-passive KGC attacks, and they presented an improved CLAS scheme. Du et al. proposed a CLAS scheme with the constant aggregate signature length and claimed that their scheme was resistant to forgery attacks. Chen et al . designed a CLAS scheme with efficient verification and proved that their CLAS scheme was secure in the random oracle model. In this paper, we demonstrate that Li et al.'s CLAS scheme, Du et al.'s CLAS scheme, and Chen et al.'s CLAS scheme are insecure against coalition attacks and present concrete examples. That is, an attacker can forge a valid aggregate signature using some illegal single signatures. To withstand suck attacks, we propose an improved CLAS scheme based on Chen et al.'s CLAS scheme.