3 ms·
I'd love to have some explain a few simple walkthroughs of why it's not doable. For instance couldn't you do you distributed text search by scrambling text cont
by endergen 15y ago
I'd love to have some explain a few simple walkthroughs of why it's not doable. For instance couldn't you do you distributed text search by scrambling text content and then doing search on scrambled search terms? Or is that not secure due to being able to infer text content by analyzing the frequency of certain sequences(Certain letters/phrases will show up.) Anyone?
In general there must be classes of symbolic manipulation that is jus abstract pattern matching that doesn't have to unencrypted to work.
What are some concrete examples of it just not working.
- jerf 15y agoA simple layman/lossy walkthrough of what homomorphic encryption is is on the edge of feasible, though I don't know of a good one beyond the mere definition. A walkthrough of why homomorphic encryption may or may not ever be efficient probably isn't; as this implies, it's an open problem on the cutting edge of research, so metaphorically the ground is rough and the jungle is still wild. We don't have a paved path with convenient rest stops for that yet.
- djcapelis 15y agoThe problems with the scheme you presented aside, you've misunderstood the problem. The goal isn't just to be able to do limited things like searching or other select things, the goal of a fully homomorphic cryptosystem is to allow any computation on encrypted data. Existing relatively feasible partially homomorphic schemes exist that allow you to do some things on encrypted data, like adds for instance. Search is also possible, I think. But neither have much to do with whether a fully homomorphic scheme is practical.
- endergen 15y agoHa, yes looking at my text search example again, it is totally illogical.
- deleted 15y ago[deleted]