4 ms·
Hashing
by peteretep 10y ago
Hashing
- StavrosK 10y agoGive me a hashed list of all the domains you've visited and I'll tell you how effective that is.
- koliber 10y agoCould you not use an adaptive password hashing algo with an absurd iteration count. Let's say each hash takes 500ms. Salt each domain with a different salt. Building a rainbow table would still be possible, but hindered. To discover one domain behind one hash, you would need to roughly run through half of the used domains with the slow password hash. That being said, the subset of popular domains is much smaller then the full set of domains, so the problem can be pared down to be much more effective than the worst-case.
- StavrosK 10y agoYes, you could, and page loads would take 500ms per resource just to decide whether it should be blocked or not.
- shakna 10y agoEFF have been working on something a little bit more practical, and have re-engaged activity on it. [0] [0] https://github.com/EFForg/privacybadger/issues/266 https://github.com/EFForg/privacybadger/issues/266
- peteretep 10y agoSure, no problem. Here are the last five: C4 AF AA 39 1A How effective is it? EDIT: here's the hashing code, in case it's helpful: substr(crypt($domain, "xx"),2,2)
- StavrosK 10y agoOh, you're right, I can't reverse that. Your Privacy Badger has just blocked half the internet, though, because a million domains match each of those hashes. Are you serious?