Comment by fragmede
1 month ago
> The server must know what it's matching at some point, to be able to generate a response
The entire point of homomorphic encryption is that it doesn't.
The homomorphic encrypted Wikipedia lookup example is pretty neat.
The setup for “that wasn’t real homomorphic encryption!” is in, when in 2-4 years it comes out that they were doing this exact thing.
The entire concept of a homomorphic encryption system is a land mine outside of obscure academic discussions. In practice systems marketed to the public as “homomorphic encryption” will result in user data exfil mark my words.
Oh, if that's the case, they really could have explained that better. The language used in Apple's article doesn't explain that the server cannot know the query or result (it implies as such, but doesn't make this clear, nor explain how/why)
> they really could have explained that better. The language used in Apple's article
This one?
https://machinelearning.apple.com/research/homomorphic-encry...
I find that description perfectly clear for someone who doesn't already know what homomorphic encryption means:
> One of the key technologies we use to do this is homomorphic encryption (HE), a form of cryptography that enables computation on encrypted data (see Figure 1). HE is designed so that a client device encrypts a query before sending it to a server, and the server operates on the encrypted query and generates an encrypted response, which the client then decrypts. The server does not decrypt the original request or even have access to the decryption key, so HE is designed to keep the client query private throughout the process.
Later:
> HE excels in settings where a client needs to look up information on a server while keeping the lookup computation encrypted.
And there's more perfectly layman-understandable in PIR and PNSS sections, complete with real-life examples and simple diagrams.
One just has to read the goddamn thing, which apparently is an insurmountably tall order these days for content that is more than 250 characters.
I read that. It doesn't actually explain how the server can tell me the Eiffel Tower is in my photo without knowing it's telling me that. It glosses over the mechanism by which it can tell me what's in my photo without the service itself knowing. Yeah, cool, never-decrypted. So how do they match up? An ultra-abstract "A[encrypted] + B[encrypted] = A+B[encrypted]" doesn't tell me anything.
As an aside, your unfounded derision about "RTFA" is unwarranted and unnecessary. That was an unusually-hostile response for like, just talking about things.
2 replies →
(btw thanks for the links!) :)