A simpler approach would be to publish a set of truncated hashes of exponentially increasing work factor for each domain. Easier to do and update, but obviously less memory efficient than probabilistic structures.
-
-
Show this thread
-
Context: I want to make my blacklists for parental protection available. Cloud-based filters are not acceptable from a privacy standpoint. Yet, I don’t want to publish a huge list of offensive domains.
Show this thread
End of conversation
New conversation -
-
-
I believe Google uses Bloom filters for its domain blacklists in Chrome, which always seems like a sensible solution for this kind of scenario
-
At $previousjob, many employees could freely look at the logs and see what companies were infected, compromised, browsing porn during the day. Even though the relevant domains were blocked for them. This is not acceptable. These blocked lookup attempts should remain private.
- 4 more replies
New conversation -
-
-
how about simply reusing a good password-style hash algorithm with salt?
-
Running a memory hard function for every single lookup is not practical. The cost has to be amortized.
- 1 more reply
New conversation -
-
-
This is assuming a proxy running client-side.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.