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?
Not a showstopper, though. Blacklist publishers should adjust the work factor according to their needs.
-
-
We did a similar experiment for
@MISPProject but it’s still in an early stage https://dial.uclouvain.be/memoire/ucl/en/object/thesis%3A10600/datastream/PDF_01/view … the code is onhttps://github.com/MISP/misp-privacy-aware-exchange … -
So, traditional bloom filter + pwhash. Good, but false positives have quite of a cost. Hence the suggestion using hash functions with increasing costs, so you can abort early when you hit a FP.
- 1 more reply
New conversation -
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.