2019 4th International Conference on System Reliability and Safety (ICSRS) 2019
DOI: 10.1109/icsrs48664.2019.8987703
|View full text |Cite
|
Sign up to set email alerts
|

Applications of Graph Integration to Function Comparison and Malware Classification

Abstract: We classify .NET files as either benign or malicious by examining directed graphs derived from the set of functions comprising the given file. Each graph is viewed probabilistically as a Markov chain where each node represents a code block of the corresponding function, and by computing the PageRank vector (Perron vector with transport), a probability measure can be defined over the nodes of the given graph. Each graph is vectorized by computing Lebesgue antiderivatives of handengineered functions defined on t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…Anderson et al (2011) has also used this strategy for assembly sequences in combination with other feature transforms of a graph. A unique approach by Slawinski and Wortman (2019) defined graphs over the extract abstract syntax trees of functions, and used a PageRank based embedding to better capture information from statically extracted features. Using just the static features in a fixed length feature vector they obtained 89.19% accuracy, which increased to 98.28% when leveraging the graph weighted embedding (Slawinski and Wortman, 2019).…”
Section: Graph Embeddingmentioning
confidence: 99%
“…Anderson et al (2011) has also used this strategy for assembly sequences in combination with other feature transforms of a graph. A unique approach by Slawinski and Wortman (2019) defined graphs over the extract abstract syntax trees of functions, and used a PageRank based embedding to better capture information from statically extracted features. Using just the static features in a fixed length feature vector they obtained 89.19% accuracy, which increased to 98.28% when leveraging the graph weighted embedding (Slawinski and Wortman, 2019).…”
Section: Graph Embeddingmentioning
confidence: 99%