%0 Conference Proceedings
%T Investigating the Nature of Routing Anomalies: Closing in on Subprefix Hijacking Attacks
%+ Technische Universität Munchen - Technical University Munich - Université Technique de Munich (TUM)
%+ National ICT Australia [Sydney] (NICTA)
%+ Eurecom [Sophia Antipolis]
%A Schlamp, Johann
%A Holz, Ralph
%A Gasser, Oliver
%A Korsten, Andreas
%A Jacquemart, Quentin
%A Carle, Georg
%A Biersack, Ernst, W.
%Z Part 4: Security
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 7th Workshop on Traffic Monitoring and Analysis (TMA)
%C Barcelona, Spain
%Y Moritz Steiner
%Y Pere Barlet-Ros
%Y Olivier Bonaventure
%3 Traffic Monitoring and Analysis
%V LNCS-9053
%P 173-187
%8 2015-04-21
%D 2015
%R 10.1007/978-3-319-17172-2_12
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X The detection of BGP hijacking attacks has been at the focus of research for more than a decade. However, state-of-the-art techniques fall short of detecting subprefix hijacking, where smaller parts of a victim’s networks are targeted by an attacker. The analysis of corresponding routing anomalies, so-called subMOAS events, is tedious since these anomalies are numerous and mostly have legitimate reasons.In this paper, we propose, implement and test a new approach to investigate subMOAS events. Our method combines input from several data sources that can reliably disprove malicious intent. First, we make use of the database of a Internet Routing Registry (IRR) to derive business relations between the parties involved in a subMOAS event. Second, we use a topology-based reasoning algorithm to rule out subMOAS events caused by legitimate network setups. Finally, we use Internet-wide network scans to identify SSL-enabled hosts in a large number of subnets. Where we observe that public/private key pairs do not change during an event, we can eliminate the possibility of an attack. We can show that subprefix announcements with multiple origins are harmless for the largest part. This significantly reduces the search space in which we need to look for hijacking attacks.
%G English
%Z TC 6
%Z WG 6.6
%2 https://hal.science/hal-01411193/document
%2 https://hal.science/hal-01411193/file/336978_1_En_12_Chapter.pdf
%L hal-01411193
%U https://hal.science/hal-01411193
%~ EURECOM
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-TMA
%~ IFIP-WG6-6
%~ IFIP-LNCS-9053