Paper 2020/496

Linear Generalized ElGamal Encryption Scheme

Demba Sow, 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. MINOR revision.SECRYPT
Keywords
CryptographyPartial homomorphic encryptionLinear AssumptionElGamal encryption scheme.
Contact author(s)
leo robert @ uca fr
History
2020-04-30: received
Short URL
https://ia.cr/2020/496
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/496,
      author = {Demba Sow and Léo Robert and Pascal Lafourcade},
      title = {Linear Generalized ElGamal Encryption Scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2020/496},
      year = {2020},
      note = {\url{https://eprint.iacr.org/2020/496}},
      url = {https://eprint.iacr.org/2020/496}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.