Cryptology ePrint Archive: Report 2015/1196

Secure Distributed Computation on Private Inputs

Geoffroy Couteau and Thomas Peters and David Pointcheval

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.

Category / Keywords: cryptographic protocols / encryption switching protocols, delegation of computations.

Original Publication (in the same form): 8th International Symposium on Foundations & Practice of Security

Date: received 14 Dec 2015

Contact author: geoffroy couteau at ens fr

Available format(s): PDF | BibTeX Citation

Version: 20151216:042348 (All versions of this report)

Short URL: ia.cr/2015/1196

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]