ScholarLens Back to search
2009•Jisuanji gongchengRequires access

ID-based Signcryption Scheme

Li Xiao, Mingxing He, Luo Da-wen, Sichuan Province

Open publisher page 4 citations

Abstract

The existing ID-based signcryption schemes have some drawbacks, such as the signcryption can not be public verified, the signcryption can be forged, the signcryption is not robust, and etc. This paper analyzes the security of the LHL scheme and adopts the bilinear parings to propose an ID-based signcryption scheme. This scheme can ensure the signcryption has some characters, such as public verifiability, unforgeability, robustness, non-repudiation and forward security. It only needs four pairs of operation and it is more efficient than other ID-based signcryption schemes.

About this research paper

What this paper is about

The existing ID-based signcryption schemes have some drawbacks, such as the signcryption can not be public verified, the signcryption can be forged, the signcryption is not robust, and etc. This paper analyzes the security of the LHL scheme and adopts the bilinear parings to propose an ID-based signcryption scheme. This scheme can ensure the signcryption has some characters, such as public verifiability, unforgeability, robustness, non-repudiation and forward security. It only needs four pairs of operation and it is more efficient than other ID-based signcryption schemes.

Why it matters

OpenAlex reports 4 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

The existing ID-based signcryption schemes have some drawbacks, such as the signcryption can not be public verified, the signcryption can be forged, the signcryption is not robust, and etc. This paper analyzes the security of the LHL scheme and adopts the bilinear parings to propose an ID-based signcryption scheme. This scheme can ensure the signcryption has some characters, such as public verifiability, unforgeability, robustness, non-repudiation and forward security. It only needs four pairs of operation and it is more efficient than other ID-based signcryption schemes.

Key concepts: Signcryption, Computer science, Scheme (mathematics), Robustness (evolution), Bilinear interpolation, Computer network, Computer security, Public-key cryptography

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
ID-based Signcryption Scheme — Research Paper | ScholarLens