Efficient Techniques for Detecting False Origin Advertisements in Inter-domain Routing

S. Y. Qiu, F. Monrose, A. Terzis, P. Mcdaniel
{"title":"Efficient Techniques for Detecting False Origin Advertisements in Inter-domain Routing","authors":"S. Y. Qiu, F. Monrose, A. Terzis, P. Mcdaniel","doi":"10.1109/NPSEC.2006.320341","DOIUrl":null,"url":null,"abstract":"The Border Gateway Protocol (BGP), and hence the Internet, remains critically vulnerable to a range of prefix forgery attacks. In this paper, we address these attacks by proposing a non-cryptographic, incrementally deployable mechanism to probabilistically detect forged BGP origin advertisements. Upon receiving an advertisement from a \"suspicious\" origin, the receiving domain intelligently probes other ASes about the received information. Any dissenting information indicates potential forgery or error, and is reported by the polled ASes to the true origin and processed appropriately. In this design, we exploit the fact that the highly connected AStopology makes it difficult to block the dissemination of information as it traverses the Internet. We evaluate the effectiveness of our probing mechanism via simulation on realistic Internet topologies. The experiments show that 98% of forgeries can be detected even when as few as 10% of the ASes participate in the protocol under a naive polling stratagem. Moreover, we show that judicious node selection can further improve detection rates while minimizing the number of probes.","PeriodicalId":206067,"journal":{"name":"2006 2nd IEEE Workshop on Secure Network Protocols","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 2nd IEEE Workshop on Secure Network Protocols","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NPSEC.2006.320341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

Abstract

The Border Gateway Protocol (BGP), and hence the Internet, remains critically vulnerable to a range of prefix forgery attacks. In this paper, we address these attacks by proposing a non-cryptographic, incrementally deployable mechanism to probabilistically detect forged BGP origin advertisements. Upon receiving an advertisement from a "suspicious" origin, the receiving domain intelligently probes other ASes about the received information. Any dissenting information indicates potential forgery or error, and is reported by the polled ASes to the true origin and processed appropriately. In this design, we exploit the fact that the highly connected AStopology makes it difficult to block the dissemination of information as it traverses the Internet. We evaluate the effectiveness of our probing mechanism via simulation on realistic Internet topologies. The experiments show that 98% of forgeries can be detected even when as few as 10% of the ASes participate in the protocol under a naive polling stratagem. Moreover, we show that judicious node selection can further improve detection rates while minimizing the number of probes.
域间路由中虚假源通告的有效检测技术
边界网关协议(BGP)以及互联网仍然极易受到一系列前缀伪造攻击。在本文中,我们通过提出一种非加密的、可增量部署的机制来解决这些攻击,以概率检测伪造的BGP源广告。当接收域收到来自“可疑”来源的广告时,接收域就会智能地探测到其他域接收到的信息。任何不一致的信息都表明可能存在伪造或错误,并由轮询的ase报告给真正的来源并进行适当处理。在这个设计中,我们利用了这样一个事实,即高度连接的拓扑结构使得信息在互联网上的传播很难被阻止。我们通过模拟真实的互联网拓扑来评估我们的探测机制的有效性。实验表明,在朴素轮询策略下,即使只有10%的ase参与协议,也可以检测到98%的伪造。此外,我们还表明,明智的节点选择可以在最小化探针数量的同时进一步提高检测率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信