Efficient and Identity-based Signcryption with Provably-secure
Yiling Wen -, Jianfeng Ma, SangJae Moon
Abstract
Yiling Wen -, Jianfeng Ma, SangJae Moon
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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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