Proceedings of the 16th International Conference on Computer Systems and Technologies 2015
DOI: 10.1145/2812428.2812432
|View full text |Cite
|
Sign up to set email alerts
|

A graph-based model for malicious code detection exploiting dependencies of system-call groups

Abstract: In this paper we present an elaborated graph-based algorithmic technique for efficient malware detection. More precisely, we utilize the system-call dependency graphs (or, for short ScD graphs), obtained by capturing taint analysis traces and a set of various similarity metrics in order to detect whether an unknown test sample is a malicious or a benign one. For the sake of generalization, we decide to empower our model against strong mutations by applying our detection technique on a weighted directed graph r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…This work uses the PageRank algorithm to calculate the weights of the graph edges and the Hamming distance weighted by the weights. Other works that use system calls graphs can be seen in [3], [4].…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…This work uses the PageRank algorithm to calculate the weights of the graph edges and the Hamming distance weighted by the weights. Other works that use system calls graphs can be seen in [3], [4].…”
Section: Related Workmentioning
confidence: 99%
“…In our analysis and simulation of the different techniques, we have observed that the number of STIDE sequences is greater than the number of system calls and graph edges, being STIDE the technique with the greatest time complexity. Therefore, the complexity of the detection stage (CD) will be similar to C1 as defined in (4). CD = (n) (4) The complexity of the second stage is a function of the combination module, which is related to the number of components of the input vector.…”
Section: Combination Modulementioning
confidence: 99%
See 1 more Smart Citation