Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

You can have hash tables that cannot be targeted by DoS attacks.

You can use a family of hash functions and seed the hash table instance with a key.

The attacker won't be able to do make assumptions regarding collisions because he doesn't have access to the initial key.



This being universal hashing right? Is there an implementation of this?




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: