{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:03Z","timestamp":1772164023799,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,8,30]],"date-time":"2010-08-30T00:00:00Z","timestamp":1283126400000},"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":[],"published-print":{"date-parts":[[2010,8,30]]},"DOI":"10.1145\/1851182.1851195","type":"proceedings-article","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T09:06:04Z","timestamp":1283245564000},"page":"87-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":55,"title":["How secure are secure interdomain routing protocols"],"prefix":"10.1145","author":[{"given":"Sharon","family":"Goldberg","sequence":"first","affiliation":[{"name":"Microsoft Research, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Yale &amp; Berkeley, New Haven, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Hummon","sequence":"additional","affiliation":[{"name":"AT&amp;T Research, Florham Park, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Rexford","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Microsoft Research MSR-TR-2010-18","author":"Goldberg S.","year":"2010","unstructured":"S. Goldberg , M. Schapira , P. Hummon , and J. Rexford , \" How secure are secure interdomain routing protocols? Full version,\" tech. rep ., Microsoft Research MSR-TR-2010-18 , June 2010 . S. Goldberg, M. Schapira, P. Hummon, and J. Rexford, \"How secure are secure interdomain routing protocols? Full version,\" tech. rep., Microsoft Research MSR-TR-2010-18, June 2010."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282411"},{"key":"e_1_3_2_1_3_1","volume-title":"Stealing the Internet: An Internet-scale man in the middle attack","author":"Pilosov A.","year":"2008","unstructured":"A. Pilosov and T. Kapela , \" Stealing the Internet: An Internet-scale man in the middle attack ,\" Aug. 2008 . Presentation at DefCon 16, http:\/\/eng.5ninesdata.com\/tkapela\/iphd-2.ppt. A. Pilosov and T. Kapela, \"Stealing the Internet: An Internet-scale man in the middle attack,\" Aug. 2008. Presentation at DefCon 16, http:\/\/eng.5ninesdata.com\/tkapela\/iphd-2.ppt."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402989"},{"key":"e_1_3_2_1_5_1","volume-title":"January","author":"Butler K.","year":"2010","unstructured":"K. Butler , T. Farley , P. McDaniel , and J. Rexford , \" A survey of BGP security issues and solutions,\" Proceedings of the IEEE , January 2010 . K. Butler, T. Farley, P. McDaniel, and J. Rexford, \"A survey of BGP security issues and solutions,\" Proceedings of the IEEE, January 2010."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.11.007"},{"key":"e_1_3_2_1_7_1","unstructured":"IETF \"Secure interdomain routing (SIDR) working group.\" http:\/\/datatracker.ietf.org\/wg\/sidr\/charter\/.  IETF \"Secure interdomain routing (SIDR) working group.\" http:\/\/datatracker.ietf.org\/wg\/sidr\/charter\/."},{"key":"e_1_3_2_1_8_1","unstructured":"R. White \"Deployment considerations for secure origin BGP (soBGP).\" draft-white-sobgp-bgp-deployment-01.txt June 2003 expired.  R. White \"Deployment considerations for secure origin BGP (soBGP).\" draft-white-sobgp-bgp-deployment-01.txt June 2003 expired."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.839934"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281123"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198259"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452335.1452337"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644934"},{"key":"e_1_3_2_1_14_1","volume-title":"June","author":"Huston G.","year":"1999","unstructured":"G. Huston , \"Interconnection , peering, and settlements,\" in Internet Global Summit (INET) , June 1999 . G. Huston, \"Interconnection, peering, and settlements,\" in Internet Global Summit (INET), June 1999."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.974527"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.06.012"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159946"},{"key":"e_1_3_2_1_20_1","unstructured":"Rensys Blog \"Pakistan hijacks YouTube.\" http:\/\/www.renesys.com\/blog\/2008\/02\/pakistan_hijacks_youtube_1.shtml.  Rensys Blog \"Pakistan hijacks YouTube.\" http:\/\/www.renesys.com\/blog\/2008\/02\/pakistan_hijacks_youtube_1.shtml."},{"key":"e_1_3_2_1_21_1","volume-title":"USENIX Security Symposium","author":"Lad M.","year":"2006","unstructured":"M. Lad , D. Massey , D. Pei , Y. Wu , B. Zhang , and L. Zhang , \" PHAS: A prefix hijack alert system,\" in Proc . USENIX Security Symposium , 2006 . M. Lad, D. Massey, D. Pei, Y. Wu, B. Zhang, and L. Zhang, \"PHAS: A prefix hijack alert system,\" in Proc. USENIX Security Symposium, 2006."}],"event":{"name":"SIGCOMM '10: ACM SIGCOMM 2010 Conference","location":"New Delhi India","acronym":"SIGCOMM '10","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2010 conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851182.1851195","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1851182.1851195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:08:50Z","timestamp":1750234130000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851182.1851195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,30]]},"references-count":21,"alternative-id":["10.1145\/1851182.1851195","10.1145\/1851182"],"URL":"https:\/\/doi.org\/10.1145\/1851182.1851195","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1851275.1851195","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,8,30]]},"assertion":[{"value":"2010-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}