An algebraic approach to IP traceback
Top Cited Papers
- 1 May 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information and System Security
- Vol. 5 (2) , 119-137
- https://doi.org/10.1145/505586.505588
Abstract
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial-of-service attack. This article reframes the traceback problem as a polynomial reconstruction problem and uses algebraic techniques from coding theory and learning theory to provide robust methods of transmission and reconstruction.Keywords
This publication has 9 references indexed in Scilit:
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- A Proposal to add Explicit Congestion Notification (ECN) to IPPublished by RFC Editor ,1999
- Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 HeadersPublished by RFC Editor ,1998
- Internet Protocol, Version 6 (IPv6) SpecificationPublished by RFC Editor ,1998
- IP Authentication HeaderPublished by RFC Editor ,1998
- IP Encapsulating Security Payload (ESP)Published by RFC Editor ,1998
- Network Ingress Filtering: Defeating Denial of Service Attacks which employ IP Source Address SpoofingPublished by RFC Editor ,1998
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- Type of Service in the Internet Protocol SuitePublished by RFC Editor ,1992