Homomorphic Encryption
Trying figure out what it is.
by Exeami
Homomorphic Encryption is an encryption technique where we can perform computations on encrypted data and get the result which will be encrypted and can be decrypted only by the owner with the secret key.
Why would anyone need Homomorphic Encryption?
Consider the scenario where you want some computation to be performed on some metadata with the help of third-party services, but you don't want to expose your or your user's data for security or privacy concerns.
The best (and currently known) use case would be on cloud computing.
The major scope of Homomorphic encryption can be in Genomics, Medical History, Finance, and wherever we deal with very sensitive private data but needs to perform some basic operations on a more generalized metadata.
A bit of history
The problem of constructing a fully homomorphic encryption scheme was first proposed in 1978 - within a year of publishing of the RSA scheme. But Fully homomorphic system was not described until 2009, when computer scientist Craig Gentry published thesis on ‘Fully Homomorphic Encryption using ideal lattices'.
Challenges
The major challenge now computational time. Many research activities are going on to speed up the process by decreasing the computational overhead that's required for homomorphic encryption. The encryption in actual homomorphic schemes' functions are considerably more complicated, often they use a mathematical calculation involving lattices with a high number of dimensions, called the Ring-Learning With Errors (RLWE) problem.
Availability
Several open-source implementations of homomorphic encryption schemes exist today.
- HELib: An early and widely used library from IBM that supports the BGV scheme and bootstrapping.
- Microsoft SEAL: A widely used open source library from Microsoft that supports the BFV and the CKKS schemes.
- PALISADE: A widely-used open source library from a consortium of DARPA-funded defense contractors that provides lattice cryptography building blocks and supports leading homomorphic encryption schemes.
Conclusion
Though the encryption scheme has been known from many years, because of complicated computations, we don't have an optimal and practical solution yet. Hope we see the Fully Homomorphic encryption within a few decades with a wider scope.
Recent Blogs
Exeami have search now!2024-01-08
It's easier than you think
Background I always felt having a search in any website is useful, and I wanted to have one in mine. Even though I know how to exactly navigate to the content I want in my website, I sometimes feel lazy and wish I had a quick way to ask and get what I want. The reasons why I want search are maybe obvious, but for some reason I had a fee…
Getting to know IndieWeb2023-09-07
What is IndieWeb and why do you need to know about it?
Once I was reading about how Amazon gave a platform for many small businesses to sell products online and how it helped them. You might even have heard that, but think about it, whenever we buy something from a small business on Amazon, we often relate it as we bought it from Amazon and never really remember the seller or the creator. This …
Why should I care about data privacy?2020-07-21
Six reasons why.
Recently when I was speaking about data privacy to a friend, he said "How do I get affected if my data is collected, in a way I am getting personal suggestions, so it seems to be good, as I have nothing to hide?" We usually listen to this in various forms, from many people around us, so I want to bring this up to you. The way we think …