2019 International Conference on Networking and Network Applications (NaNA) 2019
DOI: 10.1109/nana.2019.00047
|View full text |Cite
|
Sign up to set email alerts
|

An Automatic Signature-Based Approach for Polymorphic Worms in Big Data Environment

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

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…Paweł Szynkiewicz et al [16] developed an efficient algorithm for token extraction and a novel method for automatic multi-token signature composition. Fangwei Wang et al [17] proposed an automatic signature extraction algorithm for polymorphic worms based on the improved Term Frequency-Inverse Document Frequency (TF-IDF). Yehuda Afek et al [18] presented a basic tool for zero-day attack signature extraction.…”
Section: Related Workmentioning
confidence: 99%
“…Paweł Szynkiewicz et al [16] developed an efficient algorithm for token extraction and a novel method for automatic multi-token signature composition. Fangwei Wang et al [17] proposed an automatic signature extraction algorithm for polymorphic worms based on the improved Term Frequency-Inverse Document Frequency (TF-IDF). Yehuda Afek et al [18] presented a basic tool for zero-day attack signature extraction.…”
Section: Related Workmentioning
confidence: 99%