An efficient certificateless aggregate signature without pairing
by Yunyun Qu; Quanwu Mu
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 10, No. 2, 2018

Abstract: Aggregate signature scheme enables an algorithm to combine n signatures of n distinct messages from n users into a single short signature. The resulting aggregate signature can convince the verifier that the n users indeed sign the n messages. Since it greatly reduces the total signature length and verification cost, this primitive is useful especially in environments with low band width communication, low storage and low computability. The notion of certificateless public key cryptography which eliminates the use of certificates in certified public key cryptography and the key-escrow problem in identity-based cryptography was introduced. In this paper, we present the first certificateless aggregate signature scheme which is immune against bilinear pairings and has the advantages of both aggregate signatures and certificateless cryptography. Without the heavy computation of bilinear pairings, our proposed scheme is efficient and practical in both communication and computation for many-to-one authentication. The scheme is also proven existentially unforgeable against adaptive chosen-message attacks under the hardness of breaking elliptic curve discrete logarithm problem.

Online publication date: Wed, 04-Apr-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email