<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=us-ascii">
<meta name=Generator content="Microsoft Word 11 (filtered medium)">
<title>Abstract:</title>
<style>
<!--
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0in;
margin-bottom:.0001pt;
font-size:12.0pt;
font-family:"Times New Roman";}
span.mediumb-text1
{font-family:Arial;
color:black;
font-weight:bold;}
span.small-text1
{font-family:Arial;
color:black;}
@page Section1
{size:8.5in 11.0in;
margin:.2in 1.25in 1.0in 1.25in;}
div.Section1
{page:Section1;}
-->
</style>
<!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="2050" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang=EN-US>
<div class=Section1>
<p class=MsoNormal style='text-align:justify'><font size=1 face=Arial><span
style='font-size:8.0pt;font-family:Arial'>Martin Suchara will present his
research seminar/general exam on Monday January 21 at <o:p></o:p></span></font></p>
<p class=MsoNormal style='text-align:justify'><font size=1 face=Arial><span
style='font-size:8.0pt;font-family:Arial'>1PM in Room 402. The members of his
committee are: Jennifer Rexford (advisor), Larry <o:p></o:p></span></font></p>
<p class=MsoNormal style='text-align:justify'><font size=1 face=Arial><span
style='font-size:8.0pt;font-family:Arial'>Peterson, and David August. Everyone
is invited to attend his talk, and those faculty wishing <o:p></o:p></span></font></p>
<p class=MsoNormal style='text-align:justify'><font size=1 face=Arial><span
style='font-size:8.0pt;font-family:Arial'>to remain for the oral exam following
are welcome to do so. His abstract and reading list <o:p></o:p></span></font></p>
<p class=MsoNormal style='text-align:justify'><font size=1 face=Arial><span
style='font-size:8.0pt;font-family:Arial'>follow below.<o:p></o:p></span></font></p>
<p class=MsoNormal style='text-align:justify'><b><font size=1 face=Arial><span
style='font-size:8.0pt;font-family:Arial;font-weight:bold'><o:p> </o:p></span></font></b></p>
<p class=MsoNormal style='text-align:justify'><b><font size=1 face=Arial><span
style='font-size:8.0pt;font-family:Arial;font-weight:bold'>Securing Interdomain
Routing in Small Groups<o:p></o:p></span></font></b></p>
<p class=MsoNormal style='text-align:justify'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='text-align:justify;text-indent:.25in'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'>Although the Internet's
routing system has serious security vulnerabilities, none of the existing
proposals for a secure variant of BGP has been successfully deployed in
practice. This is not surprising since deploying protocols that require the
cooperation of tens of thousands of independently-operated networks is
problematic. Instead, we argue that small groups should be the basis for
securing BGP. We offer a new design in which interdomain routing is secured by
as few as 5–10 participating ASes, adding to the effort to secure BGP
incrementally. Existence of well accepted cryptographic protocols that secure
integrity and confidentiality of data delivery allows us to focus primarily on
securing availability of communication.<o:p></o:p></span></font></p>
<p class=MsoNormal style='text-align:justify;text-indent:.25in'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='text-align:justify;text-indent:.25in'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'>We conduct extensive
simulations on a realistic Internet topology, and identify conditions for small
groups to be effective. Even though the non-participants outnumber the group
members by several orders of magnitude, the participants can achieve remarkable
security gains by filtering compromised interdomain routes, cooperating to
expose additional path diversity, inducing non-participants to select valid
routes, and enlisting a few large ISPs to participate. We also propose two
novel mechanisms that the group members can employ to achieve these goals,
namely secure overlay routing and the cooperative announcement of each other's
address space. <o:p></o:p></span></font></p>
<p class=MsoNormal style='text-align:justify;text-indent:.25in'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='text-align:justify;text-indent:.25in'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'>Our experiments show that
the proposed technique allows small groups to secure interdomain routing
efficiently.<o:p></o:p></span></font></p>
<p class=MsoNormal style='text-align:justify'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='text-align:justify'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='text-align:justify'><b><font size=1 face=Arial><span
style='font-size:8.0pt;font-family:Arial;font-weight:bold'>Reading List<o:p></o:p></span></font></b></p>
<p class=MsoNormal style='text-align:justify'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='text-align:justify;text-autospace:none'><u><font
size=1 face="Times New Roman"><span style='font-size:8.0pt'>Textbook:<o:p></o:p></span></font></u></p>
<p class=MsoNormal style='text-align:justify'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[1] L. Peterson, and B. Davie, <a name="OLE_LINK6"></a><a
name="OLE_LINK5"><i><span style='font-style:italic'>Computer Networks: A
Systems Approach</span></i></a>, 3rd edition, Morgan Kaufmann Publishers, May 2003.<o:p></o:p></span></font></p>
<p class=MsoNormal style='text-align:justify'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='text-align:justify;text-autospace:none'><u><font
size=1 face="Times New Roman"><span style='font-size:8.0pt'>Research papers:<o:p></o:p></span></font></u></p>
<p class=MsoNormal style='text-align:justify'><font size=1
face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[1] D. Clark, "The design philosophy of the
DARPA Internet protocols," <i><span style='font-style:italic'>ACM SIGCOMM Computer
Communication Review</span></i>, Vol. 18, No. 4, pp. 106-114, Aug. 1988.<o:p></o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt'><font size=1 face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><a name="OLE_LINK2"></a><a name="OLE_LINK1"><font
size=1 face="Times New Roman"><span style='font-size:8.0pt'>[2] L. Gao,
“On inferring autonomous systems relationships in the Internet,” <i><span
style='font-style:italic'>IEEE/ACM Transactions on Networking</span></i>, Vol.
9, No. 6, pp. 733-745, Dec. 2001.<o:p></o:p></span></font></a></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt'><font size=1 face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[3] O. Nordstrom, and C. Dovrolis, “Beware
of BGP attacks,” <i><span style='font-style:italic'>ACM SIGCOMM Computer
Communication Review</span></i>, Vol. 34, No. 2, pp. 1-8, Apr. 2004.<o:p></o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt'><font size=1 face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[4] R. White, “Securing BGP through secure
origin BGP,” <i><span style='font-style:italic'>The Internet Protocol
Journal</span></i>, Vol. 6, No. 3, pp. 15-22, Sep. 2003.<o:p></o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt'><font size=1 face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[5] S. Kent, C. Lynn, and K. Seo, “Secure Border
Gateway Protocol (Secure-BGP),” <i><span style='font-style:italic'>IEEE
Journal on Selected Areas in Communications</span></i>, Vol. 18, No. 4, pp.
582–592, Apr. 2000.<o:p></o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt'><font size=1 face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[6] Y. Hu, A. Perrig, and M. Sirbu, “SPV: Secure
path vector routing for securing BGP,” <i><span style='font-style:italic'>ACM
SIGCOMM Computer Communication Review</span></i>, Vol. 34, No. 4, pp. 179-192, Aug.
2004.<o:p></o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt'><font size=1 face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[7] H. Chan, D. Dash, A. Perrig, and H. Zhang,
“Modeling adoptability of secure BGP protocols,” <i><span
style='font-style:italic'>ACM SIGCOMM Computer Communication Review</span></i>,
Vol. 36, No. 4, pp. 279-290, Aug. 2006.<o:p></o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt'><font size=1 face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[8] J. Karlin, S. Forrest, and J. Rexford,
“Pretty Good BGP: Improving BGP by cautiously adopting routes,” in <i><span
style='font-style:italic'>Proc. IEEE International Conference on Network
Protocols</span></i>, pp. 290-299, Nov. 2006.<o:p></o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt'><font size=1 face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[9] D. Wendlandt, I. Avramopoulos, D. Andersen,
and J. Rexford, “<a name="OLE_LINK4"></a><a name="OLE_LINK3">Don’t
secure routing protocols, secure data delivery</a>,” in <i><span
style='font-style:italic'>Proc. ACM SIGCOMM HotNets Workshop</span></i>, Nov.
2006.<o:p></o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt'><font size=1 face="Times New Roman"><span style='font-size:8.0pt'><o:p> </o:p></span></font></p>
<p class=MsoNormal style='margin-left:27.0pt;text-align:justify;text-indent:
-27.0pt;text-autospace:none'><font size=1 face="Times New Roman"><span
style='font-size:8.0pt'>[10] D. Andersen, H. Balakrishnan, F. Kaashoek, and
R. Morris, “Resilient overlay networks,” in <i><span
style='font-style:italic'>Proc. 18th ACM Symposium on Operating System Principles</span></i>,
Vol. 35, No. 5, pp. 131-145, Oct. 2001.<o:p></o:p></span></font></p>
</div>
</body>
</html>