New Construction of Efficient Certificateless Aggregate Signatures

Abstract

This paper proposes a novel construction of efficient certificateless aggregate signature (CLAS) scheme. On basis of the computational Diffie-Hellman (CDH) assumption, the proposed scheme can be proven existentially unforgeable against adaptive chosen-message attacks. The new scheme also requires small constant pairing computations for aggregate verification, which is independent of the number of signers. Most importantly, a certain synchronization for aggregating randomness can be avoided by the proposed scheme. All the signers don't need to share the same synchronized clock to generate the aggregate signature, which greatly decreases the implementation complexity in many application scenarios.

A Short Server-Aided Certificateless Aggregate Multisignature Scheme in the Standard Model

“…As shown in [5,[23][24][25], aggregate signature can be applied well to several practical applications such as Bitcoin blockchain, Secure BGP protocol (SBGP) [26], Healthcare, and so on. Certificateless aggregate signature was first proposed in [27], since then it has been studied in numerous of papers such as [5,[28][29][30][31][32][33][34][35], to name a few. However, all of these schemes either are insecure [29,30,35] or suffer a drawback that the signature size is linear in the number of signers in the aggregating set [5,28,[31][32][33][34].…”

New Certificateless Aggregate Signature Scheme for Healthcare Multimedia Social Network on Cloud Environment

“…Combining certificateless public key cryptography with aggregate signature, Gong et al [9] proposed the first CL-AS scheme, but they did not give a formal security proof to the scheme. After pioneer work [9], many CL-AS schemes [10,[23][24][25][26][27][28] have been proposed for various practical applications. Zhang and Zhang [23] redefined the concept and security model for CL-AS.…”

“…Xiong et al [24] presented a CL-AS scheme, but He et al [25] showed that their scheme was forgeable and further proposed a new CL-AS scheme. The CL-AS scheme proposed in [10] has been found to be insecure against the malicious-but-passive KGC attack by the researchers in [26][27][28].…”

“…Security and Communication Networks 11 Gong's Scheme [9] liu's Scheme [10] kumar's Scheme [8] Our proposed Scheme Table 2: symbol-operation-execution time.…”

“…In this subsection, we compare the security of the newly proposed CL-AS scheme with the other three CL-AS schemes [8][9][10]. For the convenience of description, let 1 and 2 denote the type1 and the type2 adversaries, respectively.…”