GEM: A generic chosen-ciphertext secure encryption method

43Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes an efficient and provably secure transform to encrypt a message with any asymmetric one-way cryptosystem. The resulting scheme achieves adaptive chosen-ciphertext security in the random oracle model. Compared to previous known generic constructions (Bellare, Rogaway, Fujisaki, Okamoto, and Pointcheval), our embedding reduces the encryption size and/or speeds up the decryption process. It applies to numerous cryptosystems, including (to name a few) ElGamal, RSA, Okamoto- Uchiyama and Paillier systems.

Cite

CITATION STYLE

APA

Coron, J. S., Handschuh, H., Joye, M., Paillier, P., Pointcheval, D., & Tymen, C. (2002). GEM: A generic chosen-ciphertext secure encryption method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2271, pp. 263–276). Springer Verlag. https://doi.org/10.1007/3-540-45760-7_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free