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?
Running a memory hard function for every single lookup is not practical. The cost has to be amortized.
-
-
The threat model can ignore DoS attacks: such a filter would run locally anyway. But even then, you don’t want to add a 5 second latency (time the number of labels for subdomain matching) for every lookup.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
ok, I understand. Didn't realize it was to be used on the blocking implementation 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.