A Strong Designated Verifiable DL Based Signcryption Scheme

Sujata Mohanty and Banshidhar Majhi
Volume: 8, No: 4, Page: 567 ~ 574, Year: 2012
10.3745/JIPS.2012.8.4.567
Keywords: Designated Verifiable, Discrete Logarithm Problem, Chosen Ciphertext Attack, Nonrepudiation
Full Text:

Abstract
This paper presents a strong designated verifiable signcryption scheme, in which a message is signcrypted by a signcryptor and only a specific receiver, who called a "designated verifier", verifies it using his own secret key. The scheme is secure, as an adversary can not verify the signature even if the secret key of the signer is compromised or leaked. The security of the proposed scheme lies in the complexity of solving two computationally hard problems, namely, the Discrete Logarithm Problem (DLP) and the Integer Factorization Problem (IFP). The security analysis of the scheme has been done and it is proved that, the proposed scheme can withstand an adaptive chosen ciphertext attack. This scheme can be very useful in organizations where there is a need to send confidential documents to a specific recipient. This scheme can also be applicable to real life scenarios, such as, e-commerce applications, e-banking and e-voting.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
Sujata Mohanty and Banshidhar Majhi, "A Strong Designated Verifiable DL Based Signcryption Scheme," Journal of Information Processing Systems, vol. 8, no. 4, pp. 567~574, 2012. DOI: 10.3745/JIPS.2012.8.4.567.

ACM Style
Sujata Mohanty and Banshidhar Majhi, "A Strong Designated Verifiable DL Based Signcryption Scheme," Journal of Information Processing Systems, 8, 4, (2012), 567~574. DOI: 10.3745/JIPS.2012.8.4.567.