ScholarLens Back to search
2010•Jisuanji gongchengRequires access

Identity-based Signcryption Scheme

Jun Li

Open publisher page 1 citations

Abstract

This paper proposes a new identity-based signcryption scheme using bilinear pairings and proves its security in the random oracle model while assuming the hardness of Bilinear Diffie-Hellman(BDH) problem.The scheme satisfies confidentiality,unforgeability,nonrepudiation,public verification and forward security.It only costs four pairing operations and two of them can be precomputed.Compared with the efficient schemes up to date,computation cost of the proposed scheme is less.

About this research paper

What this paper is about

This paper proposes a new identity-based signcryption scheme using bilinear pairings and proves its security in the random oracle model while assuming the hardness of Bilinear Diffie-Hellman(BDH) problem.The scheme satisfies confidentiality,unforgeability,nonrepudiation,public verification and forward security.It only costs four pairing operations and two of them can be precomputed.Compared with the efficient schemes up to date,computation cost of the proposed scheme is less.

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

This paper proposes a new identity-based signcryption scheme using bilinear pairings and proves its security in the random oracle model while assuming the hardness of Bilinear Diffie-Hellman(BDH) problem.The scheme satisfies confidentiality,unforgeability,nonrepudiation,public verification and forward security.It only costs four pairing operations and two of them can be precomputed.Compared with the efficient schemes up to date,computation cost of the proposed scheme is less.

Key concepts: Signcryption, Random oracle, Computer science, Bilinear interpolation, Scheme (mathematics), Identity (music), Confidentiality, Computer security

Related papers

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