Output details
11 - Computer Science and Informatics
University of Leicester
Output title
Computational complexity of traffic hijacking under BGP and S-BGP
Type
E - Conference contribution
Name of conference/published proceedings
Automata, Languages, and Programming, 39th International Colloquium, ICALP 2012, Proceedings, Part II. LNCS volume 7392.
Volume number
7392 LNCS
Issue number
PART 2
First page of article
476
ISSN of proceedings
0302-9743
Year of publication
2012
URL
-
Number of additional authors
3
Additional information
<12>The paper analyses, for different variants of BGP, the complexity of determining whether a traffic attraction attack is possible for a single malicious node. The analysis is quite involved in this setting due to the dynamic effects of the routing protocol. The paper also resolves a question raised by Goldberg, Schapira, Hummon and Rexford (SIGCOMM 2010) regarding when a traffic attraction attack is also an interception attack. The results of the paper demonstrate that more secure variants of BGP not only limit the options available to an attacker, but also increase the computational complexity of identifying an attack strategy.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
