Cryptology ePrint Archive: Report 2019/116

Multi-Key Homomophic Encryption from TFHE

Hao Chen and Ilaria Chillotti and Yongsoo Song

Abstract: In this paper, we propose a Multi-Key Homomorphic Encryption (MKHE) which allows homomorphic evaluation of a binary gate (with bootstrapping) on ciphertexts encrypted under different keys. We generalize a low-latency homomorphic encryption scheme of Chillotti et al. (ASIACRYPT 2016) by exploiting a key-extension approach of Brakerski and Perlman (CRYPTO 2016).

All the prior works on MKHE were too inefficient to be used in practice. Our construction improved the performance in terms of both asymptotic and concrete complexity: the length of ciphertexts and the computational costs of a binary gate grow linearly and quadratically on the number of parties, respectively. Furthermore, our scheme is fully-dynamic so that no information about the involved parties needs to be known before the computation and the resulting ciphertext can be reused in further computation with newly joined parties.

To the best of our knowledge, this is the first work to implement an MKHE scheme. Our implementation takes about 0.15 (resp. 0.72) seconds to perform the gate bootstrapping when the number of involved parties is 2 (resp. 4).

Category / Keywords: public-key cryptography / Multi-key homomorphic encryption, Bootstrapping

Date: received 5 Feb 2019

Contact author: Yongsoo Song at microsoft com

Available format(s): PDF | BibTeX Citation

Version: 20190207:165409 (All versions of this report)

Short URL: ia.cr/2019/116


[ Cryptology ePrint archive ]