Simple Search:

A new CCA-secure encryption based on the Gap Hashed Diffie-Hellman problem


Citation

Asbullah, Muhammad Asyraf and Kamel Ariffin, Muhammad Rezal (2013) A new CCA-secure encryption based on the Gap Hashed Diffie-Hellman problem. Journal of Communications and Information Sciences, 3 (3). pp. 45-51. ISSN 2093-9671; ESSN: 2233-9396

Abstract / Synopsis

This paper proposes a variant of the ElGamal public key encryption which is secure against chosen ciphertext attack. Our proof of security is based on the intractability of the Gap Hashed Diffie-Hellman assumption in the standard model. The proposed scheme is practical to send encrypted short messages such as credit card information, PIN code, password etc. This scheme also preserves the computational performance of the hash ElGamal encryption scheme (i.e. its simplistic algebraic construction, less exponentiation cost).


Download File

[img]
Preview
PDF (Abstract)
A new CCA.pdf

Download (84kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Institute for Mathematical Research
Publisher: Advanced Institute of Convergence Information Technology
Keywords: Chosen ciphertext security; ElGamal encryption scheme; Gap Hashed Diffie-Hellman problem.
Depositing User: Umikalthom Abdullah
Date Deposited: 10 Sep 2014 14:42
Last Modified: 21 Sep 2015 15:06
URI: http://psasir.upm.edu.my/id/eprint/30255
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item