{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:07Z","timestamp":1750307947620,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:00:00Z","timestamp":1186876800000},"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":[[2007,8,12]]},"DOI":"10.1145\/1281100.1281123","type":"proceedings-article","created":{"date-parts":[[2011,8,3]],"date-time":"2011-08-03T23:36:52Z","timestamp":1312414612000},"page":"147-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Truth in advertising"],"prefix":"10.1145","author":[{"given":"Edmund L.","family":"Wong","sequence":"first","affiliation":[{"name":"The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Praveen","family":"Balasubramanian","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Alvisi","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed G.","family":"Gouda","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Shmatikov","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. USENIX Annual Technical Conference","author":"Avramopoulos I.","year":"2006","unstructured":"I. Avramopoulos and J. Rexford . Stealth probing: Efficient data-plane security for IP routing . In Proc. USENIX Annual Technical Conference , 2006 . I. Avramopoulos and J. Rexford. Stealth probing: Efficient data-plane security for IP routing. In Proc. USENIX Annual Technical Conference, 2006."},{"key":"e_1_3_2_1_2_1","volume-title":"http:\/\/frandom.sourceforge.net","author":"Billauer E.","year":"2007","unstructured":"E. Billauer . Frandom. http:\/\/frandom.sourceforge.net , 2007 . E. Billauer. Frandom. http:\/\/frandom.sourceforge.net, 2007."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_4_1","unstructured":"Cisco Systems. Cisco CRS-1 carrier routing system. http:\/\/www.cisco.com\/application\/pdf\/en\/us\/guest\/products\/ps5763\/c1031\/cdccont 0900aecd800f8118.pdf.  Cisco Systems. Cisco CRS-1 carrier routing system. http:\/\/www.cisco.com\/application\/pdf\/en\/us\/guest\/products\/ps5763\/c1031\/cdccont 0900aecd800f8118.pdf."},{"key":"e_1_3_2_1_5_1","volume-title":"Probability and Statistics","author":"DeGroot M. H.","year":"1986","unstructured":"M. H. DeGroot . Probability and Statistics . Addison-Wesley , 1986 . M. H. DeGroot. Probability and Statistics. Addison-Wesley, 1986."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.696322"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"S. Goldberg D. Xiao B. Barak and J. Rexford. Measuring path quality in the presence of adversaries. http:\/\/www.princeton.edu\/<goldbe\/FDFL-sc.pdf 2007.  S. Goldberg D. Xiao B. Barak and J. Rexford. Measuring path quality in the presence of adversaries. http:\/\/www.princeton.edu\/<goldbe\/FDFL-sc.pdf 2007.","DOI":"10.1145\/1375457.1375480"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. NDSS","author":"Goodell G.","year":"2003","unstructured":"G. Goodell , W. Aiello , T. Griffin , J. Ioannidis , P. McDaniel , and A. Rubin . Working around BGP: An incremental approach to improving security and accuracy of interdomain routing . In Proc. NDSS , 2003 . G. Goodell, W. Aiello, T. Griffin, J. Ioannidis, P. McDaniel, and A. Rubin. Working around BGP: An incremental approach to improving security and accuracy of interdomain routing. In Proc. NDSS, 2003."},{"key":"e_1_3_2_1_10_1","unstructured":"Iperf. The TCP\/UDP bandwidth measurement tool. http:\/\/dast.nlanr.net\/Projects\/Iperf\/ 2005.  Iperf. The TCP\/UDP bandwidth measurement tool. http:\/\/dast.nlanr.net\/Projects\/Iperf\/ 2005."},{"key":"e_1_3_2_1_11_1","unstructured":"B. Jenkins. Hash functions and block ciphers. http:\/\/www.burtleburtle.net\/bob\/hash 2006.  B. Jenkins. Hash functions and block ciphers. http:\/\/www.burtleburtle.net\/bob\/hash 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.839934"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/354871.354874"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633027"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863996"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.49"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/774763.774775"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.779192"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/347057.347560"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.804827"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316208"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. NSDI","author":"Subramanian L.","year":"2004","unstructured":"L. Subramanian , V. Roth , I. Stoica , S. Shenker , and R. Katz . Listen and Whisper: Security mechanisms for BGP . In Proc. NSDI , 2004 . L. Subramanian, V. Roth, I. Stoica, S. Shenker, and R. Katz. Listen and Whisper: Security mechanisms for BGP. In Proc. NSDI, 2004."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. NDSS","author":"Wan T.","year":"2005","unstructured":"T. Wan , E. Kranakis , and P. van Oorschot . Pretty secure BGP (psBGP) . In Proc. NDSS , 2005 . T. Wan, E. Kranakis, and P. van Oorschot. Pretty secure BGP (psBGP). In Proc. NDSS, 2005."}],"event":{"name":"PODC07: ACM Symposium on Principles of Distributed Computing 2007","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Portland Oregon USA","acronym":"PODC07"},"container-title":["Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281123","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1281100.1281123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:32Z","timestamp":1750258352000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281123"}},"subtitle":["lightweight verification of route integrity"],"short-title":[],"issued":{"date-parts":[[2007,8,12]]},"references-count":23,"alternative-id":["10.1145\/1281100.1281123","10.1145\/1281100"],"URL":"https:\/\/doi.org\/10.1145\/1281100.1281123","relation":{},"subject":[],"published":{"date-parts":[[2007,8,12]]},"assertion":[{"value":"2007-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}