Dartmouth College Computer Science
Technical Report series
TR search TR listserv
|By author:||A B C D E F G H I J K L M N O P Q R S T U V W X Y Z|
|By number:||2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986|
The Border Gateway Protocol (BGP) determines how Internet traffic is
routed throughout the entire world; malicious behavior by one or more
BGP speakers could create serious security issues. Since the protocol
depends on a speaker honestly reporting path information sent by
previous speakers and involves a large number of independent speakers,
the Secure BGP (S-BGP) approach uses public-key cryptography to ensure
that a malicious speaker cannot fabricate this information. However,
such public-key cryptography is expensive: S-BGP requires a digital
signature operation on each announcement sent to each peer, and a
linear (in the length of the path) number of verifications on each
receipt. We use simulation of a 110 AS system derived from the
Internet to evaluate the impact that the processing costs of
cryptography have on BGP convergence time. We find that under heavy
load the convergence time using ordinary S-BGP is nearly twice as
large as under BGP. We examine the impact of highly aggressive caching
and pre-computation optimizations for S-BGP, and find that convergence
time is much closer to BGP. However, these optimizations may be
unrealistic, and are certainly expensive of memory. We consequently
use the structure of BGP processing to design optimizations that
reduce cryptographic overhead by amortizing the cost of private-key
signatures over many messages. We call this method
Signature-Amortization (S-A). We find that S-A provides as good or
better convergence times as the highly optimized S-BGP, but without
the cost and complications of caching and pre-computation. It is
possible therefore to minimize the impact route validation has on
convergence, by being careful with signatures, rather than consumptive
Revision 2 released May 9, 2003.
Original revision 1, of February 2003, is available in
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
David M. Nicol, Sean W. Smith, and Meiyuan Zhao, "Efficient Security for BGP Route Announcements." Dartmouth Computer Science Technical Report TR2003-440, May 2003.
Notify me about new tech reports.
Search the technical reports.
To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Technical reports collection maintained by David Kotz.