Convertible multi-authenticated encryption scheme with verification based on elliptic curve discrete logarithm problem
by Nedal Tahat
International Journal of Computer Applications in Technology (IJCAT), Vol. 54, No. 3, 2016

Abstract: The work presents a Convertible Multi-Authenticated Encryption (CMAE) scheme based on the Elliptic Curve Discrete Logarithm Problem (ECDLP). The proposed scheme intended to develop the CMAE scheme to improve performance as compared to the other existing schemes. Most CMAE schemes are very high in computational overhead and memory usage problem. This scheme desired to reduce time-consuming problem by using Elliptic Curve Cryptography (ECC). In addition, the proposed scheme provides good resistance to the chosen plain-text attacks and is proven to be secure. As for efficiency, the computation cost of the proposed scheme is smaller than the existing schemes, such as Lu et al.'s scheme.

Online publication date: Wed, 19-Oct-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com