ScholarLens Back to search
2018•Proceedings of the 2nd International Conference on Computer Science and Application EngineeringRequires access

A New Signcryption Scheme without Certificate and Linear Pairing

Yuan Gao, Xuedong Dong, Yuan Tian

Open publisher page 2 citations

Abstract

Most1 certificateless signcryption schemes are based on bilinear pairing operations. Thus, the computation efficiency is low. In this paper, a new signcryption scheme without certificate and linear pairing is proposed. This scheme is proved to be secure in therandom oracle model under the hardness assumption of computational the problem of discrete logarithm. In addition, the user's partial private key can be verified. Compared with other schemes, the scheme is more optimized in terms of security and computation efficiency.

About this research paper

What this paper is about

Most1 certificateless signcryption schemes are based on bilinear pairing operations. Thus, the computation efficiency is low. In this paper, a new signcryption scheme without certificate and linear pairing is proposed. This scheme is proved to be secure in therandom oracle model under the hardness assumption of computational the problem of discrete logarithm. In addition, the user's partial private key can be verified. Compared with other schemes, the scheme is more optimized in terms of security and computation efficiency.

Why it matters

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

Most1 certificateless signcryption schemes are based on bilinear pairing operations. Thus, the computation efficiency is low. In this paper, a new signcryption scheme without certificate and linear pairing is proposed. This scheme is proved to be secure in therandom oracle model under the hardness assumption of computational the problem of discrete logarithm. In addition, the user's partial private key can be verified. Compared with other schemes, the scheme is more optimized in terms of security and computation efficiency.

Key concepts: Signcryption, Random oracle, Discrete logarithm, Computer science, Pairing, Certificate, Bilinear interpolation, Scheme (mathematics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A New Signcryption Scheme without Certificate and Linear Pairing — Research Paper | ScholarLens