Slashdot Mirror
Denial of Service via Algorithmic Complexity
dss902 writes "We (Department of Computer Science, Rice University) present 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, we can bring a dedicated Bro server to its knees; after six minutes of carefully chosen packets, our Bro server was dropping as much as 71% of its traffic and consuming all of its CPU. We show how modern universal hashing techniques can yield performance comparable to commonplace hash functions while being provably secure against these attacks."
They claim to present a new method of low-bandwidth denial of service attack, but it looks like they're demonstrating quite an old, high-bandwidth, denial of service.
Tarsnap: Online backups for the truly paranoid
you can use a modem to post a slashdot article with a link to the target computer...
Anyone got mirrors yet?
How am I supposed to fit a pithy, relevant quote into 120 characters?
This doesn't sit well with me. Should students at a University be studying, developing, and releasing improved methods with which to launch DOS attacks..?
It's a Mansierre!
...we can bring a dedicated _Bro_ server to its knees...
Why they always trin' to bring the black man down?
Karma: The shiznight, mostly because I am the Drizzle.
You must be theonly slashdot reader who actually reads the articles. The submitter must have figured he would get away with it!
I skimmed the Project Page and aren't a couple of the examples awefully obvious?
The following one line of code brings every UNIX system I've run it on TO ITS KNEES WITHIN MINUTES!! This is a major vulnerability in EVERY UNIX system! Something must be done!
My brain is resistant to attacks using algorithmic complexity