Homomorphic Encryption for Multiplications and Pairing Evaluation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Homomorphic Encryption for Multiplications and Pairing Evaluation

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.
Fichier principal
Vignette du fichier
CL_SCN_web.pdf (242.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00763110 , version 1 (11-12-2012)

Identifiers

  • HAL Id : hal-00763110 , version 1

Cite

Fabien Laguillaumie, Guilhem Castagnos. Homomorphic Encryption for Multiplications and Pairing Evaluation. Security and Cryptography for Networks - 8th International Conference, SCN 2012, Sep 2012, Amalfi, Italy. ⟨hal-00763110⟩
209 View
323 Download

Share

Gmail Facebook X LinkedIn More