Signcryption scheme with public verifiability and forward security
YU Zhao-ping
Abstract
YU Zhao-ping
Abstract
This paper proposes an identity based signcryption scheme with both public verifiability and forward security using bilinear pairings.The scheme can separate the signature verification from message recovery.It can be applied in mobile E—business scenario,such as filtration of bad instant messages of mobile equipment.The proposed scheme is proved to be secure assuming the bilinear Diffie-Hellman problem is hard.This scheme is also very efficient regarding the computation costs and the communication overheads after analyzing and being compared with other schemes.
OpenAlex reports 1 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.
This paper proposes an identity based signcryption scheme with both public verifiability and forward security using bilinear pairings.The scheme can separate the signature verification from message recovery.It can be applied in mobile E—business scenario,such as filtration of bad instant messages of mobile equipment.The proposed scheme is proved to be secure assuming the bilinear Diffie-Hellman problem is hard.This scheme is also very efficient regarding the computation costs and the communication overheads after analyzing and being compared with other schemes.
Key concepts: Signcryption, Scheme (mathematics), Bilinear interpolation, Computer science, Bilinear map, Computer security, Signature (topology), Public-key cryptography