Hacker News new | ask | show | jobs
by randaouser 2738 days ago
I started working on fuzzy matching searchable encryption for this very reason; you can send an encrypted search term and match using jaccard similarity to an encrypted index of similar documents without information leakage of the search query or the encrypted document.

This is the state of the art at the moment and would be useful for such things as: 1)Private search over encrypted documents 2)getting your FICO score like equifax without leaking any information 3)finding genetic treatments for conditions you are predisposed to without revealing your private genetic makeup or a pharmaceutical companies patented gene therapy sequence

Typically retrieval of the document would require a TOR like network.

Ill post a link to my work in the near future. Msg me if you're interested.

1 comments

is it related to homomorphic encryption?
I imagine a decentralized search service for a particular set of search queries that users want privacy against.

it leverages Additive and Multiplicative Homomorphic Encryption with Elliptic Curves. I wanted a fuzzy searching algorithm so went with a minhash implementation on document bigram vectors which were then converted to a locality sensitive hash.

Unfortunately, it is an interactive protocol unlike something like zksnark/starks :(

I have written it in Javascript and plan to deploy it as a plugin in Brave Browser. Sundar really disappointed me recently with his rhetoric; he claims googles pursuit for information accessibility but also want to censor and allow authoritarian governments to profile users.

This would also allow location services without revealing your location