Denial of Service via Algorithmic Complexity

The Department of Computer Science at Rice University has found a new class of low-bandwidth denial of service attacks that exploit algorithmic deficiencies in many common applications' data structures... Using bandwidth less than a typical dialup modem, they can bring a dedicated Bro server to its knees. They show how modern universal hashing techniques can yield performance comparable to commonplace hash functions while being provably secure against these attacks.