%0 Conference Proceedings
%T Sign What You Really Care about – Secure BGP AS Paths Efficiently
%+ Tsinghua National Laboratory for Information Science and Technology (TNList)
%+ Department of Computer Science & Technology
%A Xiang, Yang
%A Wang, Zhiliang
%A Wu, Jianping
%A Shi, Xingang
%A Yin, Xia
%Z Part 5: IP Routing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th International Networking Conference (NETWORKING)
%C Prague, Czech Republic
%Y Robert Bestak
%Y Lukas Kencl
%Y Li Erran Li
%Y Joerg Widmer
%Y Hao Yin
%I Springer
%3 NETWORKING 2012
%V LNCS-7289
%N Part I
%P 259-273
%8 2012-05-21
%D 2012
%R 10.1007/978-3-642-30045-5_20
%K Inter-Domain Routing
%K BGP
%K Prefix Hijacking
%K Security
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X The inter-domain routing protocol, Border Gateway Protocol (BGP), plays a critical role in the reliability of the Internet routing system, but forged routes generated by malicious attacks or mis-configurations may devastate the system. The security problem of BGP has attracted considerable attention, and although several solutions have been proposed, none of them have been widely deployed due to weaknesses such as high computational cost or potential security compromise. This paper proposes Fast Secure BGP (FS-BGP), an efficient mechanism for securing AS paths and preventing prefix hijacking by signing critical AS path segments. We prove that FS-BGP can achieve a similar level of security as S-BGP, but with much higher efficiency. Our experiments use BGP UPDATE data collected from real backbone routers. Compared with S-BGP, FS-BGP only requires a very small cache, and can reduce the cost of signing and verification by orders of magnitude. Indeed, the signing and verification can be accomplished as fast as the most bursty BGP UPDATE arrivals, which implies that FS-BGP will hardly delay the propagation of routing information.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01531135/document
%2 https://inria.hal.science/hal-01531135/file/978-3-642-30045-5_20_Chapter.pdf
%L hal-01531135
%U https://inria.hal.science/hal-01531135
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-7289
%~ IFIP-NETWORKING