Colloquium Details
The Case for IP Puzzles
| Author: | Wu-chang Feng Oregon Graduate Institute |
|---|---|
| Date: | March 04, 2004 |
| Time: | 15:30 |
| Location: | 220 Deschutes |
Abstract
Over the years, distributed denial-of-service (DDoS) attacks via worms and viruses have periodically disrupted the Internet. Client puzzles have been proposed as one mechanism for protecting protocols against such attacks. In order to be effective against a wide-range of threats, we first make the case that puzzles must be placed within the IP layer. We then describe some of the scenarios IP puzzles enable and some of the open research issues that must be resolved in order to build effective, puzzle-protected network systems. Finally, we describe the results from a prototype implementation. (If time permits, I will briefly describe other on-going projects in our group including probabilistic networking, computer forensic systems, and video sensor networks.)