Abstract
Signcryption is an authenticated encryption technique that concurrently establishes message confidentiality, authenticity, integrity and non-repudiation. In this paper, we propose an efficient signcryption scheme, based on the hardness of RSA assumption and discrete logarithm problem on conic curves over a ring Zn. The protocol ensures forward secrecy, in case the sender’s secret keys are exposed and supports ciphertext authentication by an external entity, without full decryption. The protocol remains secure, as long as, either one of the hardness assumptions hold. The scheme is implemented over conic curves, which facilitates effective message encoding and decoding, as well as, efficient point operations and inverses. Conic-based RSA assumption offers resistance to low public key and low private key exponent attacks, prevalent in the original RSA cryptosystem. The proposed protocol is used to design a Business to Customer (B2C) e-commerce system, with security against replay attacks, man-in-the-middle attacks, impersonation attacks, server spoofing and double spending. The protocol is validated using automated cryptographic verification tool ProVerif.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have