Certificateless aggregate signature with efficient verification. Issue 13 (13th November 2014)

• Record Type: Journal Article
• Authors: Chen, Yu‐Chi; Tso, Raylin; Mambo, Masahiro; Huang, Kaibin; Horng, Gwoboa
• Is Part Of: Security and communication networks. Volume 8:Issue 13(2015)
• Page Start: 2232
• Page End: 2243
• Publication Date: 2014-11-13
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.1166
• Languages: English
• ISSNs: 1939-0114

Abstract

<abstract abstract-type="main" id="sec1166-abs-0001"> <title>Abstract</title> <p id="sec1166-para-0001">Certificateless public key cryptography (CL‐PKC) is a cryptosystem solving the key escrow problem of identity‐based cryptography. One of the applications of CL‐PKC is certificateless aggregate signature (CLAS) that in practice can be used to efficiently verify concealed data aggregation in wireless sensor networks. CLAS is referred to as an extension of certificateless signature, which in particular performs verification for many signatures efficiently. Therefore, not only plenty of CLAS schemes have been proposed but also the security models of CLAS were introduced in the literature. Recently, some CLAS schemes are extended from specific certificateless signature (CLS) schemes. However, we found that two certificateless signature (CLS) and their corresponding CLAS schemes are not secure. In this paper, we simplify the relation of security definitions of CLS and CLAS. Then, a new CLAS scheme is proposed, which leads to the advantages of both certificateless cryptography and aggregate signature. Moreover, our scheme only depends on constant pairing operations to verify a large number of signatures per time, because pairing is a complicated operation with high cost in computations. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>