ACM Home Page
Please provide us with feedback. Feedback
Analysis of the SPV secure routing protocol: weaknesses and lessons
Full text PdfPdf (369 KB)
Source
ACM SIGCOMM Computer Communication Review archive
Volume 37 ,  Issue 2  (April 2007) table of contents
FEATURE: Reviewed articles table of contents
Pages: 29 - 38  
Year of Publication: 2007
ISSN:0146-4833
Authors
Barath Raghavan  University of California, San Diego, CA
Saurabh Panjwani  University of California, San Diego, CA
Anton Mityagin  University of California, San Diego, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 53,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1232919.1232923
What is a DOI?

ABSTRACT

We analyze a secure routing protocol, Secure Path Vector (SPV), proposed in SIGCOMM 2004. SPV aims to provide authenticity for route announcements in the Border Gateway Protocol (BGP) using an efficient alternative to ordinary digital signatures, called constant-time signatures. Today, SPV is often considered the best cryptographic defense for BGP.

We find subtle flaws in the design of SPV which lead to attacks that can be mounted by 60% of Autonomous Systems in the Internet. In addition, we study several of SPV's design decisions and assumptions and highlight the requirements for security of routing protocols. In light of our analysis, we reexamine the need for constant-time signatures and find that certain standard digital signature schemes can provide the same level of efficiency for route authenticity.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Bellare and B. Yee. Forward security in private key cryptography. In Proceedings of CT-RSA, Apr. 2003.
2
 
3
K. Butler, T. Farley, P. McDaniel, and J. Rexford. A survey of BGP security: Issues and solutions. Technical Report TD-5UGJ33, AT&T Research, Apr. 2005.
4
 
5
M. Caesar and J. Rexford. BGP routing policies in ISP networks. Technical Report UCB/CSD-05-1377, University of California, Berkeley, Mar. 2005.
 
6
CAIDA Skitter Project. http://www.caida.org/tools/measurement/skitter/.
7
 
8
Cisco Systems. Personal communication, Apr. 2006.
 
9
Crypto++ library. http://www.eskimo.com/¿weidai/cryptlib.html.
 
10
A. Fujioka, T. Okamoto, and S. Miyaguchi. ESIGN: An efficient digital signature implementation for smart cards. In Proceedings of EUROCRYPT, Apr. 1991.
11
 
12
S. Kent, C. Lynn, and K. Seo. Secure border gateway protocol (S-BGP). IEEE Journal on Selected Areas in Communications, 18(4), 2000.
 
13
E. Kiltz, A. Mityagin, S. Panjwani, and B. Raghavan. Append-only signatures. In Proceedings of ICALP, July 2005.
14
 
15
A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham. Sequential aggregate signatures from trapdoor permutations. In Proceedings of EUROCRYPT, May 2004.
 
16
S. Matyas, C. Meyer, and J. Oseas. Generating strong one-way functions with cryptographic algorithms. IBM Technical Disclosure Bulletin 27:5658--5659, 1985.
 
17
A. Menezes, M. Qu, D. Stinson, and Y. Wang. Evaluation of security level of cryptography: ESIGN signature scheme. CRYPTREC Project, Japan, Jan. 2001.
18
 
19
T. Okamoto and J. Stern. Almost uniform density of power residues and the provable security of ESIGN. In Proceedings of ASIACRYPT, Nov. 2003.
20
 
21
 
22
 
23
T. Wan, E. Kranakis, and P. van Oorschot. Pretty secure BGP (psBGP). In Proceedings of ISOC NDSS, Feb. 2005.
 
24
R. White. Securing BGP through Secure Origin BGP (soBGP). The Internet Protocol Journal, Sept. 2003.
25

Collaborative Colleagues:
Barath Raghavan: colleagues
Saurabh Panjwani: colleagues
Anton Mityagin: colleagues