Mining TCP packets to detect stepping-stone intrusion (non-reviewed)

Long Ni, Jianhua Yang, D. Y. Song
{"title":"Mining TCP packets to detect stepping-stone intrusion (non-reviewed)","authors":"Long Ni, Jianhua Yang, D. Y. Song","doi":"10.1109/SECON.2008.4494298","DOIUrl":null,"url":null,"abstract":"There have been many approaches proposed to detect stepping-stone Intrusion. Besides having the problem of being vulnerable to intruder's time and chaff perturbation, those approaches have high false alarm because they predict an intrusion based on detecting stepping-stone. Being a stepping-stone does not necessarily mean an intrusion because some applications using stepping-stones are legitimate. One better way to detect stepping-stone intrusion is to estimate the length of a connection chain from a host where our monitor program resides to the victim site. This length is measured in connections. Based on our observation, we found that even though some applications (users) need to use stepping-stone, but it is highly suspicious to access a host via more than three computers. The problem of detecting stepping-stone intrusion is reduced to estimating the length of an interactive session; this length is called downstream length from the monitoring host. In this paper, we propose an algorithm to estimate the downstream length by a clustering method.","PeriodicalId":188817,"journal":{"name":"IEEE SoutheastCon 2008","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE SoutheastCon 2008","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.2008.4494298","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

There have been many approaches proposed to detect stepping-stone Intrusion. Besides having the problem of being vulnerable to intruder's time and chaff perturbation, those approaches have high false alarm because they predict an intrusion based on detecting stepping-stone. Being a stepping-stone does not necessarily mean an intrusion because some applications using stepping-stones are legitimate. One better way to detect stepping-stone intrusion is to estimate the length of a connection chain from a host where our monitor program resides to the victim site. This length is measured in connections. Based on our observation, we found that even though some applications (users) need to use stepping-stone, but it is highly suspicious to access a host via more than three computers. The problem of detecting stepping-stone intrusion is reduced to estimating the length of an interactive session; this length is called downstream length from the monitoring host. In this paper, we propose an algorithm to estimate the downstream length by a clustering method.
挖掘TCP报文检测踏脚石入侵(未审查)
已经提出了许多检测踏脚石入侵的方法。这些方法除了易受入侵者时间和箔条扰动的影响外,还存在基于检测踏脚石来预测入侵的高虚警性。作为踏脚石并不一定意味着入侵,因为一些使用踏脚石的应用程序是合法的。检测踏脚石入侵的一个更好的方法是估计从监控程序驻留的主机到受害站点的连接链的长度。这个长度是用连接数来衡量的。根据我们的观察,我们发现即使一些应用程序(用户)需要使用踏脚石,但通过三台以上的计算机访问主机是高度可疑的。将踏脚石入侵检测问题简化为估计交互会话的长度;这个长度称为监视主机的下游长度。本文提出了一种用聚类方法估计下游长度的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信