{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:47Z","timestamp":1750307927981,"version":"3.41.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,3,20]],"date-time":"2007-03-20T00:00:00Z","timestamp":1174348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2007,3,20]]},"abstract":"<jats:p>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.<\/jats:p>\n          <jats:p>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.<\/jats:p>","DOI":"10.1145\/1232919.1232923","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:52:18Z","timestamp":1175802738000},"page":"29-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Analysis of the SPV secure routing protocol"],"prefix":"10.1145","volume":"37","author":[{"given":"Barath","family":"Raghavan","sequence":"first","affiliation":[{"name":"University of California, San Diego, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saurabh","family":"Panjwani","sequence":"additional","affiliation":[{"name":"University of California, San Diego, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Mityagin","sequence":"additional","affiliation":[{"name":"University of California, San Diego, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,3,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1767011.1767013"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/378444.378449"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029102.1029119"},{"key":"e_1_2_1_6_1","unstructured":"CAIDA Skitter Project. http:\/\/www.caida.org\/tools\/measurement\/skitter\/.  CAIDA Skitter Project. http:\/\/www.caida.org\/tools\/measurement\/skitter\/."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159946"},{"key":"e_1_2_1_8_1","unstructured":"Cisco Systems. Personal communication Apr. 2006.  Cisco Systems. Personal communication Apr. 2006."},{"key":"e_1_2_1_9_1","unstructured":"Crypto++ library. http:\/\/www.eskimo.com\/\u00bfweidai\/cryptlib.html.  Crypto++ library. http:\/\/www.eskimo.com\/\u00bfweidai\/cryptlib.html."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_38"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015488"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.839934"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_36"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352617"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_5"},{"key":"e_1_2_1_16_1","unstructured":"S. Matyas C. Meyer and J. Oseas. Generating strong one-way functions with cryptographic algorithms. IBM Technical Disclosure Bulletin 27: 5658--5659 1985.  S. Matyas C. Meyer and J. Oseas. Generating strong one-way functions with cryptographic algorithms. IBM Technical Disclosure Bulletin 27:5658--5659 1985."},{"volume-title":"CRYPTREC Project","year":"2001","author":"Menezes A.","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/997150.997152"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40061-5_17"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.501988"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646039.678322"},{"volume-title":"Proceedings of USENIX\/ACM NSDI","year":"2004","author":"Subramanian L.","key":"e_1_2_1_22_1"},{"volume-title":"Proceedings of ISOC NDSS","year":"2005","author":"Wan T.","key":"e_1_2_1_23_1"},{"key":"e_1_2_1_24_1","unstructured":"R. White. Securing BGP through Secure Origin BGP (soBGP). The Internet Protocol Journal Sept. 2003.  R. White. Securing BGP through Secure Origin BGP (soBGP). The Internet Protocol Journal Sept. 2003."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102139"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1232919.1232923","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1232919.1232923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:51Z","timestamp":1750258311000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1232919.1232923"}},"subtitle":["weaknesses and lessons"],"short-title":[],"issued":{"date-parts":[[2007,3,20]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3,20]]}},"alternative-id":["10.1145\/1232919.1232923"],"URL":"https:\/\/doi.org\/10.1145\/1232919.1232923","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2007,3,20]]},"assertion":[{"value":"2007-03-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}