2019 18th IEEE International Conference on Trust, Security and Privacy in Computing and Communications/13th IEEE International 2019
DOI: 10.1109/trustcom/bigdatase.2019.00094
|View full text |Cite
|
Sign up to set email alerts
|

Feature Extraction Optimization for Bitstream Communication Protocol Format Reverse Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…e improved AC algorithm was used to determine the frame boundary, Apriori algorithm was used to extract character features, and FP growth algorithm was used to realize field association analysis. Based on similar ideas, Hei et al [15] proposed a new method based on AC and AC apriori algorithm, by changing the length of keywords, using Zipf distribution to count the keywords, only the first ranked as keywords, and then using AC algorithm to count the frequency of keywords in all groups, and then mining frequent sets through apriori algorithm, so as to obtain the possible message format, and then according to the support degree of the message, it carries on the statistics reduction. Fan et al [16] thought that the previous format inference algorithms ignored the correlation between the front and back order of the fields, so they proposed an improved algorithm SPREA based on FP-tree [17].…”
Section: Related Workmentioning
confidence: 96%
“…e improved AC algorithm was used to determine the frame boundary, Apriori algorithm was used to extract character features, and FP growth algorithm was used to realize field association analysis. Based on similar ideas, Hei et al [15] proposed a new method based on AC and AC apriori algorithm, by changing the length of keywords, using Zipf distribution to count the keywords, only the first ranked as keywords, and then using AC algorithm to count the frequency of keywords in all groups, and then mining frequent sets through apriori algorithm, so as to obtain the possible message format, and then according to the support degree of the message, it carries on the statistics reduction. Fan et al [16] thought that the previous format inference algorithms ignored the correlation between the front and back order of the fields, so they proposed an improved algorithm SPREA based on FP-tree [17].…”
Section: Related Workmentioning
confidence: 96%
“…e amount of data has a significant impact on the quality of the protocol specification, but multiple sequence matching has exponential complexity because sequence matching algorithms use only two messages at a time as input [29]. Zhang et al [30][31][32] studied and proposed a feature extraction method combining multipattern matching and association rules by investigating the bitstream protocol feature extraction technique to divide the bitstream protocol multiprotocol data frames into single-protocol data frames. e work is done for offline data, which cannot meet the real-time nature of bitstream data analysis and identification.…”
Section: Related Workmentioning
confidence: 99%
“…It is considered that the central point of each class is the sequence of protocol features, which can represent the characteristics of this class, so as to realize the recognition of the protocol. Clustering analysis 14 mostly focuses on the analysis of protocol semantics. Association analysis is to analyze by setting the minimum support and minimum confidence, filter the nonfeature string with support, and then calculate the implied relationship between the string and the string with confidence.…”
Section: Related Workmentioning
confidence: 99%