A New Signcryption Scheme Based on Bilinear Groups
Signcryption is a method of combining both digital signature process with encryption process. This method has a computational cost less than that of doing those processes sequentially [1,9]. In this paper, a new signcryption scheme is presented. This scheme is similar to that of Zheng signcryption algorithm but it uses bilinear groups and the security of our scheme is based on Computational Diffie-Hellman Problem instead of Discrete Logarithm Problem. Since methods rely on bilinear groups have high security also with relatively small keys, we believe that the proposed scheme possesses high security and efficiency.