2013Journal of Computer ApplicationsRequires access

Certificateless aggregate signcryption scheme with public verifiability

Xu Wang

Open publisher page 0 citations

Abstract

The research on aggregate signcryption is mostly based on identity-based encryption to provide confidentiality and authentication,thus improving efficiency.But aggregate signcryption has the problem in certificate management and key escrow.Therefore,it needs to design new aggregate signcryption schemes,which not only solve the problem of certificate management and key escrow,but also guarantee the confidentiality and authentication of the scheme.This paper analyzed the main stream aggregate signcryption schemes and their development.Combined with the scheme of Zhang et al.(ZHANG L,ZHANG F T.A new certificateless aggregate signature scheme.Computer Communications,2009,32(6):1079-1085) and the needs mentioned above,this article designed a certificateless aggregate signcryption scheme,and proved its confidentiality and unforgeability based on the Bilinear Diffie-Hellman(BDH) problem and Computational Diffie-Hellman(CDH) problem.The experimental results show that the proposed scheme is more efficient and the amount of computation is equal or lower in comparison with the other schemes.What's more,the new scheme is publicly verifiable,and it eliminates the use of public key certificate and solves the problem in key escrow.

About this research paper

What this paper is about

The research on aggregate signcryption is mostly based on identity-based encryption to provide confidentiality and authentication,thus improving efficiency.But aggregate signcryption has the problem in certificate management and key escrow.Therefore,it needs to design new aggregate signcryption schemes,which not only solve the problem of certificate management and key escrow,but also guarantee the confidentiality and authentication of the scheme.This paper analyzed the main stream aggregate signcryption schemes and their development.Combined with the scheme of Zhang et al.(ZHANG L,ZHANG F T.A new certificateless aggregate signature scheme.Computer Communications,2009,32(6):1079-1085) and the needs mentioned above,this article designed a certificateless aggregate signcryption scheme,and proved its confidentiality and unforgeability based on the Bilinear Diffie-Hellman(BDH) problem and Computational Diffie-Hellman(CDH) problem.The experimental results show that the proposed scheme is more efficient and the amount of computation is equal or lower in comparison with the other schemes.What's more,the new scheme is publicly verifiable,and it eliminates the use of public key certificate and solves the problem in key escrow.

Why it matters

A significance statement is not available in the OpenAlex record.

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

The research on aggregate signcryption is mostly based on identity-based encryption to provide confidentiality and authentication,thus improving efficiency.But aggregate signcryption has the problem in certificate management and key escrow.Therefore,it needs to design new aggregate signcryption schemes,which not only solve the problem of certificate management and key escrow,but also guarantee the confidentiality and authentication of the scheme.This paper analyzed the main stream aggregate signcryption schemes and their development.Combined with the scheme of Zhang et al.(ZHANG L,ZHANG F T.A new certificateless aggregate signature scheme.Computer Communications,2009,32(6):1079-1085) and the needs mentioned above,this article designed a certificateless aggregate signcryption scheme,and proved its confidentiality and unforgeability based on the Bilinear Diffie-Hellman(BDH) problem and Computational Diffie-Hellman(CDH) problem.The experimental results show that the proposed scheme is more efficient and the amount of computation is equal or lower in comparison with the other schemes.What's more,the new scheme is publicly verifiable,and it eliminates the use of public key certificate and solves the problem in key escrow.

Key concepts: Signcryption, Key escrow, Computer science, Public-key cryptography, Authentication (law), Escrow, Key (lock), Scheme (mathematics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Certificateless aggregate signcryption scheme with public verifiability — Research Paper | ScholarLens