Cryptology ePrint Archive: Report 2020/496

Linear Generalized ElGamal Encryption Scheme

Demba Sow and Léo Robert and Pascal Lafourcade

Abstract: ElGamal public key encryption scheme has been designed in the 80ís. It is one of the first partial homomorphic encryption and one of the first IND-CPA probabilistic public key encryption scheme. A linear version has been recently proposed by Boneh et al. In this paper, we present a linear encryption based on a generalized version of ElGamal encryption scheme. We prove that our scheme is IND-CPA secure under the linear assumption. We design a also generalized ElGamal scheme from the generalized linear. We also run an evaluation of performances of our scheme. We show that the decryption algorithm is faster than the existing versions.

Category / Keywords: public-key cryptography / Cryptography, Partial homomorphic encryption, Linear Assumption, ElGamal encryption scheme.

Original Publication (with minor differences): SECRYPT

Date: received 28 Apr 2020

Contact author: leo robert at uca fr

Available format(s): PDF | BibTeX Citation

Version: 20200430:112522 (All versions of this report)

Short URL: ia.cr/2020/496


[ Cryptology ePrint archive ]