Algebraic geometric code based IP traceback

Author

Bai, Chunyan ; Feng, Guiliang ; Wang, Gesan

Author_Institution

Center for Adv. Comput. Studies, Louisiana Univ., Lafayette, LA, USA

fYear

2004

fDate

2004

Firstpage

49

Lastpage

56

Abstract

In this paper, we attempt to use algebraic-geometric codes to solve the polynomial reconstruction problem, which is the key step for the algebraic IP traceback over the Internet to defend against the DoS attacks. The detailed mathematical expression for the fullpath polynomial is given with analysis showing the deterministic characteristic, the backward compatibility, the low time and storage complexity and the incremental deployment of our scheme. Furthermore, how to reduce the overhead in the IP header is proposed and analyzed with details in this paper. The comparison of our scheme with other related work shows that our scheme can not only be implemented for today´s routers (IPv4), but also be extended for future router´s usage whenever the router IP address be enlarged (IPv6).

Keywords

IP networks; Internet; algebraic geometric codes; telecommunication network routing; telecommunication security; IP header; IP traceback; Internet; algebraic geometric code; backward compatibility; denial of service attack; polynomial reconstruction problem; routers; storage complexity; Computer crime; Computer worms; Costs; Floods; IP networks; Polynomials; Security; Stability; Web and internet services; Web server;

fLanguage

English

Publisher

ieee

Conference_Titel

Performance, Computing, and Communications, 2004 IEEE International Conference on

Print_ISBN

0-7803-8396-6

Type

conf

DOI

10.1109/PCCC.2004.1394939

Filename

1394939