3 ms·
The point of homomorphic encryption is that you don't need to decrypt it. Fully homomorphic encryption allows for arbitrary computations on encrypted data. This
by mrob 8y ago
The point of homomorphic encryption is that you don't need to decrypt it. Fully homomorphic encryption allows for arbitrary computations on encrypted data. This is mostly of theoretical interest now, but it's mathematically possible.
- sokoloff 8y agoCould I write a spelling and grammar checker that works under such a system? Or a language translation service. Or a red-eye reduction or image filtering (Instagram/Snapchat type filters) algorithm on photos? In a context where the author of the document is not the same and doesn’t trust the author of the algorithm(s) and both authors wish to keep the details of their content/algorithm hidden from the other party. It’s a genuine question for which I’ve done a small amount of google/Wikipedia reading, but I suspect the answer is “no, of course not”, but I’ve been surprised before by tech/crypto solutions that I didn’t know the details of.
- taejo 8y agoIn theory, yes, though the performance is not such that you'd want to run complex algorithms on large datasets.
- sokoloff 8y agoCould you succinctly describe (roughly) how to do language translation or grammar checking under such a system? I can’t grasp it...
- taejo 8y agoThe FHE systems support a couple of basic operations, which you'd have to compile your language translation algorithm down to. It'd be pretty similar to building your language translation algorithm out of transistors.