Secure Distributed Computation on Private Inputs

Geoffroy Couteau 1, 2, 3 Thomas Peters 1, 2, 3 David Pointcheval 1, 2, 3
2 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : The recent notion of encryption switching protocol (ESP) allows two players to obliviously switch between two encryption schemes. Instantiated from multiplicatively homomorphic encryption and additively homomorphic encryption, ESPs provide a generic solution to two-party computation and lead to particularly efficient protocols for arithmetic circuits in terms of interaction and communication. In this paper, we further investigate their applications and show how ESPs can be used as an alternative to fully-homomorphic encryption (FHE) to outsource computation on sensitive data to cloud providers. Our interactive solution relies on two non-colluding servers which obliviously perform the operations on encrypted data, and eventually send back the outcome in an encrypted form to the appropriate players. Our solution makes use of a nice combination of the Paillier encryption scheme and the Damgard-Jurik variant with multiple trapdoors, which notably allows cross-user evaluations on encrypted data.
Type de document :
[Research Report] Cryptology ePrint Archive: Report 2015/1196, IACR Cryptology ePrint Archive. 2015
Liste complète des métadonnées
Contributeur : David Pointcheval <>
Soumis le : mercredi 16 décembre 2015 - 22:18:11
Dernière modification le : jeudi 11 janvier 2018 - 06:22:10


  • HAL Id : hal-01245235, version 1




Geoffroy Couteau, Thomas Peters, David Pointcheval. Secure Distributed Computation on Private Inputs. [Research Report] Cryptology ePrint Archive: Report 2015/1196, IACR Cryptology ePrint Archive. 2015. 〈hal-01245235〉



Consultations de la notice