Computational complexity of traffic hijacking under BGP and S-BGP
From MaRDI portal
Publication:496018
DOI10.1016/j.tcs.2015.07.038zbMath1329.68044arXiv1205.4564OpenAlexW2950790936MaRDI QIDQ496018
Giuseppe Di Battista, Maurizio Patrignani, Marco Chiesa, Erlebach, Thomas
Publication date: 16 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.4564
computational complexitynetwork protocolsBGPhijacking attackinterception attackinterdomain routingrouting stability
Analysis of algorithms and problem complexity (68Q25) Network protocols (68M12) Internet topics (68M11)
Cites Work