Paper 2013/198

On Evaluating Circuits with Inputs Encrypted by Different Fully Homomorphic Encryption Schemes

Zhizhou Li and Ten H. Lai

Abstract

We consider the problem of evaluating circuits whose inputs are encrypted with possibly different encryption schemes. Let $\mathcal{C}$ be any circuit with input $x_1,\dots ,x_t\in \{0,1\}$, and let ${\mathcal{E}}_i$, $1\le i\le t$, be (possibly) different fully homomorphic encryption schemes, whose encryption algorithms are ${\text{Enc}}_i$. Suppose $x_i$ is encrypted with $$ under a public key $$, say $$. Is there any algorithm $$ such that $$ returns a ciphertext $$ that, once decrypted, equals $$? We propose a solution to this seemingly impossible problem with the number of different schemes and/or keys limited to a small value. Our result also provides a partial solution to the open problem of converting any FHE scheme to a multikey FHE scheme.