Fast malware family detection method using control flow graphs
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kang, Boojoong | - |
dc.contributor.author | Kim, Hye Seon | - |
dc.contributor.author | Kim, T. | - |
dc.contributor.author | Kwon, H. | - |
dc.contributor.author | Im, E.G. | - |
dc.date.accessioned | 2022-07-16T18:27:45Z | - |
dc.date.available | 2022-07-16T18:27:45Z | - |
dc.date.created | 2021-05-11 | - |
dc.date.issued | 2011-11 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/167282 | - |
dc.description.abstract | As attackers make variants of existing malware, it is possible to detect unknown malware by comparing with already-known malware's information. Control flow graphs have been used in dynamic analysis of program source code. In this paper, we proposed a new method which can analyze and detect malware binaries using control flow graphs and Bloom filter by abstracting common characteristics of malware families. The experimental results showed that processing overhead of our proposed method is much lower than n-gram based methods. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinary, Inc. | - |
dc.title | Fast malware family detection method using control flow graphs | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Im, E.G. | - |
dc.identifier.doi | 10.1145/2103380.2103439 | - |
dc.identifier.scopusid | 2-s2.0-84863145461 | - |
dc.identifier.bibliographicCitation | Proceedings of the 2011 ACM Research in Applied Computation Symposium, RACS 2011, pp.287 - 292 | - |
dc.relation.isPartOf | Proceedings of the 2011 ACM Research in Applied Computation Symposium, RACS 2011 | - |
dc.citation.title | Proceedings of the 2011 ACM Research in Applied Computation Symposium, RACS 2011 | - |
dc.citation.startPage | 287 | - |
dc.citation.endPage | 292 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Bloom filters | - |
dc.subject.keywordPlus | control flow graph | - |
dc.subject.keywordPlus | Control flow graphs | - |
dc.subject.keywordPlus | Detection methods | - |
dc.subject.keywordPlus | Malware analysis | - |
dc.subject.keywordPlus | Malwares | - |
dc.subject.keywordPlus | Processing overhead | - |
dc.subject.keywordPlus | Program source codes | - |
dc.subject.keywordPlus | Blooms (metal) | - |
dc.subject.keywordPlus | Data flow analysis | - |
dc.subject.keywordPlus | Flow graphs | - |
dc.subject.keywordPlus | Graphic methods | - |
dc.subject.keywordPlus | Network security | - |
dc.subject.keywordPlus | Computer crime | - |
dc.subject.keywordAuthor | Bloom filter | - |
dc.subject.keywordAuthor | control flow graph | - |
dc.subject.keywordAuthor | malware analysis | - |
dc.subject.keywordAuthor | network security | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/2103380.2103439 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.