2010International Journal of Digital Content Technology and its ApplicationsRequires access

Efficient and Identity-based Signcryption with Provably-secure

Yiling Wen -, Jianfeng Ma, SangJae Moon

Open publisher page 2 citations

Abstract

The idea of signcryption is to provide a method to encrypt and sign data together, so it is more efficient than using an encryption scheme combined with a signature scheme. We present an identitybased signcryption solution, which is one of the most efficient, provably-secure schemes proposed to date. Our scheme admits provable security in the random oracle model under the bilinear DiffieHellman assumption using the definitions proposed by Boyen and it is also forward secure.

About this research paper

What this paper is about

The idea of signcryption is to provide a method to encrypt and sign data together, so it is more efficient than using an encryption scheme combined with a signature scheme. We present an identitybased signcryption solution, which is one of the most efficient, provably-secure schemes proposed to date. Our scheme admits provable security in the random oracle model under the bilinear DiffieHellman assumption using the definitions proposed by Boyen and it is also forward secure.

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

The idea of signcryption is to provide a method to encrypt and sign data together, so it is more efficient than using an encryption scheme combined with a signature scheme. We present an identitybased signcryption solution, which is one of the most efficient, provably-secure schemes proposed to date. Our scheme admits provable security in the random oracle model under the bilinear DiffieHellman assumption using the definitions proposed by Boyen and it is also forward secure.

Key concepts: Signcryption, Random oracle, Computer science, Bilinear interpolation, Provable security, Encryption, Scheme (mathematics), Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Efficient and Identity-based Signcryption with Provably-secure — Research Paper | ScholarLens