Encryption Switching Protocols Revisited: Switching Modulo p

Guilhem Castagnos 1 Laurent Imbert 2 Fabien Laguillaumie 3
1 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
2 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
3 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : At CRYPTO 2016, Couteau, Peters and Pointcheval introduced a new primitive called encryption switching protocols, allowing to switch ciphertexts between two encryption schemes. If such an ESP is built with two schemes that are respectively additively and multiplica-tively homomorphic, it naturally gives rise to a secure 2-party computation protocol. It is thus perfectly suited for evaluating functions, such as multivariate polynomials, given as arithmetic circuits. Couteau et al. built an ESP to switch between Elgamal and Paillier encryptions which do not naturally fit well together. Consequently, they had to design a clever variant of Elgamal over Z/nZ with a costly shared decryption. In this paper, we first present a conceptually simple generic construction for encryption switching protocols. We then give an efficient instantiation of our generic approach that uses two well-suited protocols, namely a variant of Elgamal in Z/pZ and the Castagnos-Laguillaumie encryption which is additively homomorphic over Z/pZ. Among other advantages, this allows to perform all computations modulo a prime p instead of an RSA modulus. Overall, our solution leads to significant reductions in the number of rounds as well as the number of bits exchanged by the parties during the interactive protocols. We also show how to extend its security to the malicious setting.
Type de document :
Communication dans un congrès
CRYPTO 2017 - 37th International Cryptology Conference, Aug 2017, Santa Barbara, United States. Lecture Notes in Computer Science, 10401, pp.255-287, 2017, Advances in Cryptology – CRYPTO 2017. 〈https://www.iacr.org/conferences/crypto2017/〉. 〈10.1007/978-3-319-63688-7_9〉
Liste complète des métadonnées

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

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01587451
Contributeur : Laurent Imbert <>
Soumis le : jeudi 14 septembre 2017 - 11:29:41
Dernière modification le : jeudi 24 mai 2018 - 15:59:24

Fichier

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

Identifiants

Citation

Guilhem Castagnos, Laurent Imbert, Fabien Laguillaumie. Encryption Switching Protocols Revisited: Switching Modulo p. CRYPTO 2017 - 37th International Cryptology Conference, Aug 2017, Santa Barbara, United States. Lecture Notes in Computer Science, 10401, pp.255-287, 2017, Advances in Cryptology – CRYPTO 2017. 〈https://www.iacr.org/conferences/crypto2017/〉. 〈10.1007/978-3-319-63688-7_9〉. 〈lirmm-01587451〉

Partager

Métriques

Consultations de la notice

452

Téléchargements de fichiers

178