Analysis of Attacks in Various Signcryption Methods Using Diffie-Hellman Problem (DHP)

Abstract

Signcryption is a cryptographic primitive that will achieve both authenticity and confidentiality by logically single step. It has its attention in cryptography because of its lower computational cost and communication overhead. Many signcryption schemes were proposed so far. The security of many cryptosystemsis based on the Diff-Hellman Assumption(DHA). The motivation of Diff-Hellman Problem (DHP) is, many security system use mathematical operations that are fast to compute but hard to reverse. If the cryptographic system is solved DHP then the system is easy to broke, in this paper the various attacks in the different signcryption methods such as generalized, attribute, and online/offline signcryptionare critically analyzed and compared using DHP.