ACM Home Page
Please provide us with feedback. Feedback
DoS protection for UDP-based protocols
Full text PdfPdf (91 KB)
Source Conference on Computer and Communications Security archive
Proceedings of the 10th ACM conference on Computer and communications security table of contents
Washington D.C., USA
SESSION: DOS protection table of contents
Pages: 2 - 7  
Year of Publication: 2003
ISBN:1-58113-738-9
Authors
Charlie Kaufman  IBM
Radia Perlman  Sun Microsystems
Bill Sommerfeld  Sun Microsystems
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 86,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/948109.948113
What is a DOI?

ABSTRACT

Since IP packet reassembly requires resources, a denial of service attack can be mounted by swamping a receiver with IP fragments. In this paper we argue how this attack need not affect protocols that do not rely on IP fragmentation, and argue how most protocols, e.g., those that run on top of TCP, can avoid the need for fragmentation. However, protocols such as IPsec's IKE protocol, which both runs on top of UDP and requires sending large packets, depend on IP packet reassembly. Photuris, an early proposal for IKE, introduced the concept of a stateless cookie, intended for DoS protection. However, the stateless cookie mechanism cannot protect against a DoS attack unless the receiver can successfully receive the cookie, which it will not be able to do if reassembly resources are exhausted. Thus, without additional design and/or implementation defenses, an attacker can successfully, through a fragmentation attack, prevent legitimate IKE handshakes from completing. Defense against this attack requires both protocol design and implementation defenses. The IKEv2 protocol was designed to make it easy to design a defensive implementation. This paper explains the defense strategy designed into the IKEv2 protocol, along with the additional needed implementation mechanisms. It also describes and contrasts several other potential strategies that could work for similar UDP-based protocols.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Aiello, W., Bellovin, S., Blaze, M., Canetti, R., Ioannidis, J., Keromytis, A., Reingold, O., "Just Fast Keying (JFK)", draft-ietf-ipsec-jfk-00.txt, Nov 2001.
 
2
Aiello, W., Bellovin, S., Blaze, M., Canetti, R., Ioannidis, J., Keromytis, A., Reingold, O., draft-ietf-ipsec-jfk-03, April 2002.
 
3
Harkins, D., and Carrel, D., "The Internet Key Exchange (IKE)", RFC 2409, November 1998.
 
4
Harkins, D., Kaufman, C., and Perlman, R., "The Internet Key Exchange (IKE) Protocol, draft-ietf-ipsec-ikev2-00.txt, Nov 2001.
 
5
Harkins, D., Kaufman, C., Kent, S., Kivinen, T., and Perlman, R., "The Internet Key Exchange (IKE) Protocol, draft-ietf-ipsec-ikev2-01.txt, Feb 2002.
 
6
Harkins, D., Kaufman, C., Kent, S., Kivinen, T., and Perlman, R., "Design Rationale for IKEv2, draft-ietf-ipsec-ikev2-rationale-00.txt, Feb 2002.
 
7
 
8
Karn, P., "The Photuris Key Management Protocol", internet draft draft-karn-photuris-00.txt, December 1994.
9
 
10
Mogul, J. and S. Deering, "Path MTU discovery", RFC 1191, November 1990.
 
11
Orman, H., "The OAKLEY Key Determination Protocol", RFC 2412, November, 1998.
 
12
 
13
 
14
 
15
Simpson, W. A., "IKE/ISAKMP Considered Harmful", Usenix ;login, December 1999, Volume 24, Number 6.


Collaborative Colleagues:
Charlie Kaufman: colleagues
Radia Perlman: colleagues
Bill Sommerfeld: colleagues