Denial of Service via Algorithmic Complexity Attacks

@inproceedings{Crosby2003DenialOS,
  title={Denial of Service via Algorithmic Complexity Attacks},
  author={Scott A. Crosby and Dan S. Wallach},
  booktitle={USENIX Security Symposium},
  year={2003}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 328 citations. REVIEW CITATIONS