2018網際網路技術學刊Requires access

New Efficient Certificateless Aggregate Signature Scheme

Zhiyan Xu, Libing Wu, Yongjun Ren, Debiao He

Open publisher page 1 citations

Abstract

Certificateless aggregate signature (CLAS) scheme has been widely adopted in resource-constrained wireless mobile networks, because it not only solves the problems of the certificate management and private key escrow, but also achieves batch validation. In this paper, we first analyze the security for Kang et al.’s CLAS scheme which was claimed to be secure against various types of attacks. Unfortunately, we find that their scheme can not resist malicious KGC’s attack and present a concrete attack method. To enhance security, we propose a new certificateless aggregate signature scheme. Furthermore, we formally prove the security of the scheme in the random oracle model. Finally, we evaluate the performance of our proposed scheme. Compared with the original scheme, our new scheme fixes the security flaw, while reducing the total computational costs, so that is more practical and adoptable in real life.

About this research paper

What this paper is about

Certificateless aggregate signature (CLAS) scheme has been widely adopted in resource-constrained wireless mobile networks, because it not only solves the problems of the certificate management and private key escrow, but also achieves batch validation. In this paper, we first analyze the security for Kang et al.’s CLAS scheme which was claimed to be secure against various types of attacks. Unfortunately, we find that their scheme can not resist malicious KGC’s attack and present a concrete attack method. To enhance security, we propose a new certificateless aggregate signature scheme. Furthermore, we formally prove the security of the scheme in the random oracle model. Finally, we evaluate the performance of our proposed scheme. Compared with the original scheme, our new scheme fixes the security flaw, while reducing the total computational costs, so that is more practical and adoptable in real life.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Certificateless aggregate signature (CLAS) scheme has been widely adopted in resource-constrained wireless mobile networks, because it not only solves the problems of the certificate management and private key escrow, but also achieves batch validation. In this paper, we first analyze the security for Kang et al.’s CLAS scheme which was claimed to be secure against various types of attacks. Unfortunately, we find that their scheme can not resist malicious KGC’s attack and present a concrete attack method. To enhance security, we propose a new certificateless aggregate signature scheme. Furthermore, we formally prove the security of the scheme in the random oracle model. Finally, we evaluate the performance of our proposed scheme. Compared with the original scheme, our new scheme fixes the security flaw, while reducing the total computational costs, so that is more practical and adoptable in real life.

Key concepts: Key escrow, Computer science, Random oracle, Scheme (mathematics), Computer security, Aggregate (composite), Public-key cryptography, Signature (topology)

Related papers

Back to paper searchBrowse research topicsOriginal source
New Efficient Certificateless Aggregate Signature Scheme — Research Paper | ScholarLens