I think the opening example involving Google is misleading. When I hear "Google" I think "search the web". The articles is about getting an input encrypted with key k, processing it without decrypting it, and sending back an output that is encrypted with key k, too. Now it looks to me that the whole input must be encrypted with key k. But in the search example, the inputs include a query (which could be encrypted wit…
Fully homomorphic encryption and the dawn of a private internet
121–130 of 202 posts
Re: Fully homomorphic encryption and the dawn of a private internet
#122I come from a values basis that privacy is a human right, and governments should be extremely limited in retailiatory powers against a just and democratic usage of powers against them. (things like voting, arts, media, free speech etc)
Re: Fully homomorphic encryption and the dawn of a private internet
#123How do you send a password reset email with this. Eventually your mail server will need the plaintext address in order to send the email. And that point can be leaked in a data breach. It's idealistic to think this could solve data braches because businesses knowing who their customers are is such a fundamental concept.
A password reset e-mail is supposed to expire pretty quickly though, so would it really matter in practice?
Re: Fully homomorphic encryption and the dawn of a private internet
#124Here's what I don't understand about homomorphic encryption and so struggle to trust in the very concept. If you can process encrypted data and get useful results, then a major part of the purpose of encryption is defeated, right? How am I wrong?
The result is encrypted. It's useful to the key holder, not to the party doing the computation.
Given that cryptography experts seem to be asserting otherwise, I assume that there's something important that I'm not understanding here.
Re: Fully homomorphic encryption and the dawn of a private internet
#125Earlier quoted context omitted.
While correct, that doesn't answer the question at all, though. If I have my address book submited into an FHE system and want to sort by name - how do you do that if the FHE system does not have access to cleartext names?
When comparing two ciphertexts A,B a FHE sorting function will output a sorted pair of two new ciphertexts: E.g. FHE_SORT(A,B) -> (X,Y) where Dec(X) But without decoding, there's no way of knowing whether X (or Y) comes from A or B. Source: II. D of https://eprint.iacr.org/2015/995.pdf
To do anything practical the server usually needs to provide the client with gigabytes of per-client-key encrypted seed data.
Re: Fully homomorphic encryption and the dawn of a private internet
#126Re: Fully homomorphic encryption and the dawn of a private internet
#127Earlier quoted context omitted.
Do they offer deals like that often? List price is "from $24/month" for 6TB (no further details provided without registering an account).
They tend to do promotions, typically only valid for 24h and only advertised on certain forums like LET, a couple of times per year - typically at least around their company anniversary date or Black Friday. There are others too, e.g. Servarica who keep their Black Friday offers running all year round.
I don’t understand the logic here so I’m going to assume I’m being obtuse. Doesn’t that just mean that’s their standard price? Why or how would you ever pay more?
Re: Fully homomorphic encryption and the dawn of a private internet
#128> FHE enables computation on encrypted data This is fascinating. Could someone ELI5 how computation can work using encrypted data? And does "computation" apply to ordinary internet transactions like when using a REST API, for example?
A very basic way of how it works: encryption is basically just a function e(m, k)=c. “m” is your plaintext and “c” is the encrypted data. We call it an encryption function if the output looks random to anyone that does not have the key If we could find some kind of function “e” that preserves the underlying structure even when the data is encrypted you have the outline of a homomorphic system. E.g. if the following h…
But isn't such a function a weakened form of encryption? Properly encrypted data should be indistinguishable from noise. "Preserving underlying structure" seems to me to be in opposition to the goal of encryption.
Re: Fully homomorphic encryption and the dawn of a private internet
#129FHE might allow arbitrary computation, but I use most services because they have some data I want to use: their search index, their knowledge, their database of chemicals, my bank account transactions, whatever. So unless Google lets me encrypt their entire search index, they can still see my query at the time it interacts with the index, or else they cannot fulfill it. The other point is incentives: outside of some…
Exactly what I thought. In the end it really isn't in most of the big corps interest to not see your data/query. They need/want to see it so why would they degrade their ability to do so if they can just say no and you will have to rely on using their services without FHE. For banking applications cool, everyone else debatable if it will ever be accepted.
Re: Fully homomorphic encryption and the dawn of a private internet
#130FHE might allow arbitrary computation, but I use most services because they have some data I want to use: their search index, their knowledge, their database of chemicals, my bank account transactions, whatever. So unless Google lets me encrypt their entire search index, they can still see my query at the time it interacts with the index, or else they cannot fulfill it. The other point is incentives: outside of some…
Here's an implementation of a fully private search engine using FHE that allows querying Wikipedia with the server remaining oblivious as to what you're reading: https://spiralwiki.com/