基于多态蠕虫检测的网络数据包指令序列最大长度分析

K. Tatara, Y. Hori, K. Sakurai
{"title":"基于多态蠕虫检测的网络数据包指令序列最大长度分析","authors":"K. Tatara, Y. Hori, K. Sakurai","doi":"10.1109/MUE.2008.119","DOIUrl":null,"url":null,"abstract":"The importance of the method for finding out the worms that are made through the modification of parts of their original worms increases. It is difficult to detect these worms by comparing with the simple definition that past anti-virus software adapts. Moreover, if it is not an already-known worm, it is not possible to detect it. In this paper, we pay attention to the Toth et al.'s method to extract the executable code included in the dataflows on the network and detect the attack by measuring the length of them. The importance of the method for finding out the worms that are made through the modification of parts of their original worms increases. It is difficult to detect these worms by comparing with the simple definition that past anti-virus software adapts. Moreover, if it is not an already- known worm, it is not possible to detect it. In this paper, we pay attention to the Toth et al.'s method to extract the executable code included in the dataflows on the network and detect the attack by measuring the length of them. Then, we describe the problem of their method and how to solve it.Then, we describe the problem of their method and how to solve it.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Analyzing Maximum Length of Instruction Sequence in Network Packets for Polymorphic Worm Detection\",\"authors\":\"K. Tatara, Y. Hori, K. Sakurai\",\"doi\":\"10.1109/MUE.2008.119\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The importance of the method for finding out the worms that are made through the modification of parts of their original worms increases. It is difficult to detect these worms by comparing with the simple definition that past anti-virus software adapts. Moreover, if it is not an already-known worm, it is not possible to detect it. In this paper, we pay attention to the Toth et al.'s method to extract the executable code included in the dataflows on the network and detect the attack by measuring the length of them. The importance of the method for finding out the worms that are made through the modification of parts of their original worms increases. It is difficult to detect these worms by comparing with the simple definition that past anti-virus software adapts. Moreover, if it is not an already- known worm, it is not possible to detect it. In this paper, we pay attention to the Toth et al.'s method to extract the executable code included in the dataflows on the network and detect the attack by measuring the length of them. Then, we describe the problem of their method and how to solve it.Then, we describe the problem of their method and how to solve it.\",\"PeriodicalId\":203066,\"journal\":{\"name\":\"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MUE.2008.119\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MUE.2008.119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

通过对原始蠕虫的某些部分进行修改来发现蠕虫的方法的重要性增加了。与过去的杀毒软件所采用的简单定义相比,很难检测到这些蠕虫。此外,如果它不是已知的蠕虫,则不可能检测到它。本文主要研究Toth等人提取网络数据流中包含的可执行代码,并通过测量数据流长度来检测攻击的方法。通过对原始蠕虫的某些部分进行修改来发现蠕虫的方法的重要性增加了。与过去的杀毒软件所采用的简单定义相比,很难检测到这些蠕虫。此外,如果它不是已知的蠕虫,则不可能检测到它。本文主要研究Toth等人提取网络数据流中包含的可执行代码,并通过测量数据流长度来检测攻击的方法。然后,我们描述了他们的方法的问题和如何解决它。然后,我们描述了他们的方法的问题和如何解决它。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analyzing Maximum Length of Instruction Sequence in Network Packets for Polymorphic Worm Detection
The importance of the method for finding out the worms that are made through the modification of parts of their original worms increases. It is difficult to detect these worms by comparing with the simple definition that past anti-virus software adapts. Moreover, if it is not an already-known worm, it is not possible to detect it. In this paper, we pay attention to the Toth et al.'s method to extract the executable code included in the dataflows on the network and detect the attack by measuring the length of them. The importance of the method for finding out the worms that are made through the modification of parts of their original worms increases. It is difficult to detect these worms by comparing with the simple definition that past anti-virus software adapts. Moreover, if it is not an already- known worm, it is not possible to detect it. In this paper, we pay attention to the Toth et al.'s method to extract the executable code included in the dataflows on the network and detect the attack by measuring the length of them. Then, we describe the problem of their method and how to solve it.Then, we describe the problem of their method and how to solve it.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信