skip to main content
10.1145/1851182.1851195acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Free Access

How secure are secure interdomain routing protocols

Published:30 August 2010Publication History

ABSTRACT

In response to high-profile Internet outages, BGP security variants have been proposed to prevent the propagation of bogus routing information. To inform discussions of which variant should be deployed in the Internet, we quantify the ability of the main protocols (origin authentication, soBGP, S-BGP, and data-plane verification) to blunt traffic-attraction attacks; i.e., an attacker that deliberately attracts traffic to drop, tamper, or eavesdrop on packets.

Intuition suggests that an attacker can maximize the traffic he attracts by widely announcing a short path that is not flagged as bogus by the secure protocol. Through simulations on an empirically-determined AS-level topology, we show that this strategy is surprisingly effective, even when the network uses an advanced security solution like S-BGP or data-plane verification. Worse yet, we show that these results underestimate the severity of attacks. We prove that finding the most damaging strategy is NP-hard, and show how counterintuitive strategies, like announcing longer paths, announcing to fewer neighbors, or triggering BGP loop-detection, can be used to attract even more traffic than the strategy above. These counterintuitive examples are not merely hypothetical; we searched the empirical AS topology to identify specific ASes that can launch them. Finally, we find that a clever export policy can often attract almost as much traffic as a bogus path announcement. Thus, our work implies that mechanisms that police export policies (e.g., defensive filtering) are crucial, even if S-BGP is fully deployed.

References

  1. 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.Google ScholarGoogle Scholar
  2. H. Ballani, P. Francis, and X. Zhang, "A study of prefix hijacking and interception in the Internet," in ACM SIGCOMM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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.Google ScholarGoogle Scholar
  4. S. Goldberg, S. Halevi, A. D. Jaggard, V. Ramachandran, and R. N. Wright, "Rationality and traffic attraction: Incentives for honest path announcements in BGP," in ACM SIGCOMM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. K. Butler, T. Farley, P. McDaniel, and J. Rexford, "A survey of BGP security issues and solutions," Proceedings of the IEEE, January 2010.Google ScholarGoogle Scholar
  6. P. McDaniel, W. Aiello, K. Butler, and J. Ioannidis, "Origin authentication in interdomain routing," Computer Networks, Nov. 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. IETF, "Secure interdomain routing (SIDR) working group." http://datatracker.ietf.org/wg/sidr/charter/.Google ScholarGoogle Scholar
  8. R. White, "Deployment considerations for secure origin BGP (soBGP)." draft-white-sobgp-bgp-deployment-01.txt, June 2003, expired.Google ScholarGoogle Scholar
  9. S. Kent, C. Lynn, and K. Seo, "Secure border gateway protocol (S-BGP)," J. Selected Areas in Communications, vol. 18, pp. 582--592, April 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. E. L. Wong, P. Balasubramanian, L. Alvisi, M. G. Gouda, and V. Shmatikov, "Truth in advertising: Lightweight verification of route integrity," in PODC, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. X. Dimitropoulos, D. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, and kc claffy, "AS relationships: Inference and validation," ACM SIGCOMM Computer Communication Review, Jan. 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Y.-J. Chi, R. Oliveira, and L. Zhang, "Cyclops: The Internet AS-level observatory," ACM SIGCOMM Computer Communication Review, Oct. 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. B. Augustin, B. Krishnamurthy, and W. Willinger, "IXPs: Mapped?," in Proc. Internet Measurement Conference, Nov. 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. G. Huston, "Interconnection, peering, and settlements," in Internet Global Summit (INET), June 1999.Google ScholarGoogle Scholar
  15. L. Gao and J. Rexford, "Stable Internet routing without global coordination," IEEE/ACM Transactions on Networking, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. L. Gao, "On inferring automonous system relationships in the Internet," IEEE/ACM Transactions on Networking, vol. 9, pp. 733--745, Dec. 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Karlin, S. Forrest, and J. Rexford, "Autonomous security for autonomous systems," Computer Networks, Oct. 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. T. Griffin, F. B. Shepherd, and G. Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Transactions on Networking, Apr. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. H. Chang, D. Dash, A. Perrig, and H. Zhang, "Modeling adoptability of secure BGP protocol," in ACM SIGCOMM, Sept. 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Rensys Blog, "Pakistan hijacks YouTube." http://www.renesys.com/blog/2008/02/pakistan_hijacks_youtube_1.shtml.Google ScholarGoogle Scholar
  21. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. How secure are secure interdomain routing protocols

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGCOMM '10: Proceedings of the ACM SIGCOMM 2010 conference
      August 2010
      500 pages
      ISBN:9781450302012
      DOI:10.1145/1851182
      • cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 40, Issue 4
        SIGCOMM '10
        October 2010
        481 pages
        ISSN:0146-4833
        DOI:10.1145/1851275
        Issue’s Table of Contents

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 30 August 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate554of3,547submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader