Homomorphic Encryption for Multiplications and Pairing Evaluation

Fabien Laguillaumie 1 Guilhem Castagnos 2
1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We propose a generic approach to design homomorphic encryption schemes, which extends Gj\o steen's framework. From this generic method, we deduce a new homomorphic encryption scheme in a com\-posite-order subgroup of points of an elliptic curve which admits a pairing $e: \G\times \G \rightarrow \G_t$. This scheme has some interesting theoretical and practical properties: it allows an arbitrary number of multiplications in the groups $\G$ \emph{and} $\G_t$, \emph{as well as} a pairing evaluation on the underlying plaintexts. We prove the semantic security under chosen plaintext attack of our scheme under a generalized subgroup membership assumption, and we also prove that it \emph{cannot} achieve {\sf ind-cca1} security. We eventually propose an original application to shared decryption. On the theoretical side, this scheme is an example of cryptosystem which can be naturally implemented with groups of prime order, as the homomorphic properties require only a \emph{projecting} pairing using Freeman's terminology. However the application to shared decryption also relies on the fact that the pairing is \emph{cancelling} and therefore does not survive this conversion.
Type de document :
Communication dans un congrès
Ivan Visconti and Roberto De Prisco. Security and Cryptography for Networks - 8th International Conference, SCN 2012, Sep 2012, Amalfi, Italy. 2012, Security and Cryptography for Networks - 8th International Conference, SCN 2012, Amalfi, Italy, September 5-7, 2012. Proceedings
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00763110
Contributeur : Fabien Laguillaumie <>
Soumis le : mardi 11 décembre 2012 - 09:31:06
Dernière modification le : vendredi 20 avril 2018 - 15:44:26
Document(s) archivé(s) le : mardi 12 mars 2013 - 03:52:39

Fichier

CL_SCN_web.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00763110, version 1

Collections

Citation

Fabien Laguillaumie, Guilhem Castagnos. Homomorphic Encryption for Multiplications and Pairing Evaluation. Ivan Visconti and Roberto De Prisco. Security and Cryptography for Networks - 8th International Conference, SCN 2012, Sep 2012, Amalfi, Italy. 2012, Security and Cryptography for Networks - 8th International Conference, SCN 2012, Amalfi, Italy, September 5-7, 2012. Proceedings. 〈hal-00763110〉

Partager

Métriques

Consultations de la notice

358

Téléchargements de fichiers

229