Tinkering about how to publish domain blacklists without immediately revealing the domains. Compressed bloom filters or Golomb-coded sets using hash functions whose complexity increases exponentially + a final memory hard hash?
-
Show this thread
-
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.
3 replies 0 retweets 0 likesShow 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.
1 reply 0 retweets 1 likeShow this thread -
Replying to @jedisct1
Isn't there research on this? Seems like a studied problem.
2 replies 0 retweets 0 likes
Replying to @dgryski
And even if there is research, it’s not applied.
7:32 AM - 4 Apr 2018
from Saint-Mandé, France
0 replies
0 retweets
0 likes
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.