Member-only story
Towards Total Encryption
Adding and Scalar Multiplying With Homomorphic Encryption
I predict in a decade, we will process encrypted values. This will allow us to preserve the privacy of data but still use mathematical operations. For example, we could run machine learning models on encrypted data, without revealing the core data used underneath. For this we are likely to look towards full homomorphic encryption, and which supports all of the arithmetic operators. But many current applications just need to support adding and subtraction functions for homomorphic encryption. This will support partial homomorphic encryption. For this, Paillier provided a useful method [here]:
And here is a quick presentation:
Its citation count shows that although it was first published in 1999, it has been a slow-burner, and its impact has generally increased over the years:
