Open Access Open Access  Restricted Access Subscription Access

Aggregate Signature without Pairing from Certificateless Cryptography

Lunzhi Deng,
Yixian Yang,
Yuling Chen,
Xiong Wang,


In some real-world applications, many messages must be processed at the same time with low computational costs. In an aggregate signature scheme, anyone can combine n signatures on n messages from n users into a single signature, the resulting signature can convince a verifier that the n users indeed signed the n corresponding messages. All of the aggregate signature schemes currently known used bilinear pairings, however, the computational cost of the pairing is much higher than that of the exponentiation in a RSA group and that of the scalar multiplication over the elliptic curve group. In this paper, we propose a certificateless aggregate signature based on RSA and discrete logarithm (DL) problem, and prove the security in the random oracle model. To the best of author’s knowledge, the scheme is the first certificateless aggregate signature scheme without pairing.

Citation Format:
Lunzhi Deng, Yixian Yang, Yuling Chen, Xiong Wang, "Aggregate Signature without Pairing from Certificateless Cryptography," Journal of Internet Technology, vol. 19, no. 5 , pp. 1479-1486, Sep. 2018.

Full Text:



  • There are currently no refbacks.

Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Library and Information Center, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd. Shoufeng, Hualien 97401, Taiwan, R.O.C.
Tel: +886-3-931-7017  E-mail: