A Concrete Security Treatment of an Efficient Identity –Based Generalized Ring Signcryption Scheme

ID-based Generalized Ring Signcryption scheme (IDGRSC) provides an important cryptographic primitive to protect the privacy and authenticity of a collection of users who are connected through an ad-hoc network.Many schemes have been proposed and most of them proved to be insecure against both adaptive chosen ciphertext attack and adaptive chosen message attack. On the other hand, since the IDGRSC scheme is usually derived from bilinear pairing, it still suffers from computational expensive primitive which affects negatively the overall system performance.In this paper, we propose a Concrete Security Treatment of an Efficient Identity–Based Generalized Ring Signcryption Scheme which is named (CS-IDGRSC) scheme which addresses the above problems.We provide formal security proof of the proposed scheme to prove that it is semantically secured against both adaptive chosen ciphertext attacks and adaptive chosen message attacks.Finally, the simulation results show that the CS-IDGRSC scheme has less computation complexity, less communication complexity, and less implementation complexity compared with the existing IDGRSC schemes.