Denial of Service via Algorithmic Complexity Attacks
| dc.contributor.author | Crosby, Scott A. | en_US |
| dc.contributor.author | Wallach, Dan S. | en_US |
| dc.date.accessioned | 2017-08-02T22:02:59Z | en_US |
| dc.date.available | 2017-08-02T22:02:59Z | en_US |
| dc.date.issued | 2003-02-12 | en_US |
| dc.date.note | February 12, 2003 | en_US |
| dc.description.abstract | We present a new class of low-bandwidth denial of service attacks that exploit algorithmic deficiencies in many common applications' data structures. Frequently used data structures have "average-case'' expected running time that's far more efficient than the worst case. For example, both binary trees and hash tables can degenerate to linked lists with carefully chosen input. We show how an attacker can effectively compute such input, and we demonstrate attacks against the hash table implementations in two versions of Perl, the Squid web proxy, and the Bro intrusion detection system. Using bandwidth less than a typical 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. | en_US |
| dc.format.extent | 13 pp | en_US |
| dc.identifier.citation | Crosby, Scott A. and Wallach, Dan S.. "Denial of Service via Algorithmic Complexity Attacks." (2003) https://hdl.handle.net/1911/96313. | en_US |
| dc.identifier.digital | TR03-416 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/96313 | en_US |
| dc.language.iso | eng | en_US |
| dc.rights | You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s). | en_US |
| dc.title | Denial of Service via Algorithmic Complexity Attacks | en_US |
| dc.type | Technical report | en_US |
| dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1