By Topic

Application of logarithmic keying for securing ASPATH in inter-domain routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. Vidya ; Dept. of Comput. Sci. & Eng., Anna Univ., Chennai, India ; V. Rhymend Uthariaraj

Current day Internet is vulnerable to a variety of attacks during routing between Autonomous Systems (ASes). Routing between ASes in the internet is taken care of by standard de-facto inter-domain protocol called Border Gateway Protocol (BGP). BGP generally performs the hearsay technique for propagating the route for an IP prefix. Each BGP speaker advertises the AS -PATH through UPDATE messages for an IP prefix. The receiving BGP speaker of the neighboring AS append its own AS Number (ASN) in the existing AS-PATH and advertises it. But there is no guarantee in BGP that the received AS-PATH would have been modified, inserted or deleted. Hence AS path falsification is not detected by BGP. Various Security proposals were suggested by many researchers but none of them was deployed, due to various reasons. There exists a tradeoff between security, efficiency and performance in those proposals [1]. Due to their performance overheads and lack of proper security, we propose using Symmetric Key approaches for achieving perfect security. We consider the internet to be a combination of acyclic networks and star networks, where acyclic network is formed by the peer to peer ASes and customer-provider ASes [14| and star network is formed by an ISP providing services to many stub ASes. We apply a technique called logarithmic keying [2] to that combination of networks. The grand parent AS of each AS is trusted to identify the falsification of AS-Path. Also a temporal database is proposed to maintain historical advertisements at the Regional Internet Registry (RIR).

Published in:

2009 First International Conference on Advanced Computing

Date of Conference:

13-15 Dec. 2009