Universal Hashing in Practice
Universal hashing (or near-universal) is a key ingredient in defending against algorithmic complexity attacks that engineer hash table collisions from user input.

See Scott A. Crosby and Dan S. Wallach's "Denial of Service via Algorithmic Complexity Attacks".