A scalable algorithm for homomorphic computing on multi-core clusters

Homomorphic encryption draws huge attention as it provides a way of privacy-preserving computations on encrypted data. But sadly, such computations are extremely expensive both in terms of calculation time and memory consumption and so much slower than the corresponding computations with unencrypted data. One solution is using parallelism and in this work, we investigate using distributed architectures of interconnected nodes (multi-core clusters) to execute homomorphic computations that have been programmed with the cingulata environment, a toolchain which is able to generate boolean circuits (where gates manipulate encrypted booleans) from homomorphic C++ codes. Such circuits are spliting into slices and we have used a bsp algorithm to executed each of them.