Bandwidth Issues White Papers
Mitigating Bandwidth-Exhaustion Attacks Using Congestion Puzzles: (Extended Abstract)
Overview This paper presents Congestion Puzzles (CP), a new countermeasure to bandwidth-exhaustion attacks. Like other defenses based on client puzzles, CP attempts to force attackers to invest vast resources in order to effectively perform denial-of-service attacks. Unlike previous puzzle-based approaches, however, this is the first designed for the bandwidth-exhaustion attacks that are common at the network (IP) layer. At the core of CP is an elegant distributed puzzle mechanism that permits routers to cooperatively impose and check puzzles. The paper demonstrates through analysis and simulation that CP can effectively defend networks from flooding attacks without relying on the formulation of attack signatures to filter traffic.
| Publisher | Association for Computing Machinery | File Format | |
|---|---|---|---|
| Date Published | October 2004 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 2 out of 4 users found this white paper useful
White Paper RSS
Download
Register
