Linearly Homomorphic Encryption from DDH - ENS de Lyon - École normale supérieure de Lyon Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Linearly Homomorphic Encryption from DDH

Résumé

We design a linearly homomorphic encryption scheme whose security relies on the hardness of the decisional Diffie-Hellman problem. Our approach requires some special features of the underlying group. In particular, its order is unknown and it contains a subgroup in which the discrete logarithm problem is tractable. Therefore, our instantiation holds in the class group of a non maximal order of an imaginary quadratic field. Its algebraic structure makes it possible to obtain such a linearly homomorphic scheme whose message space is the whole set of integers modulo a prime p and which supports an unbounded number of additions modulo p from the ciphertexts. A notable difference with previous works is that, for the first time, the security does not depend on the hardness of the factorization of integers. As a consequence, under some conditions, the prime p can be scaled to fit the application needs.
Fichier principal
Vignette du fichier
CTRSA15_ddhhomo_extended.pdf (450.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01213284 , version 1 (08-10-2015)

Identifiants

Citer

Guilhem Castagnos, Fabien Laguillaumie. Linearly Homomorphic Encryption from DDH. The Cryptographer's Track at the RSA Conference 2015, Apr 2015, San Francisco, United States. ⟨10.1007/978-3-319-16715-2_26⟩. ⟨hal-01213284⟩
303 Consultations
514 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More