Sujata Mohanty, Banshidhar Majhi, Journal of Information Processing Systems Vol. 8, No. 4, pp. 567-574, Dec. 2012  

https://doi.org/10.3745/JIPS.2012.8.4.567
Keywords: Designated Verifiable, Discrete Logarithm Problem, Chosen Ciphertext Attack, Nonrepudiation
Fulltext: PDF

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.

Statistics
Cite this article