2013
DOI: 10.1016/j.jnca.2013.01.013
|View full text |Cite
|
Sign up to set email alerts
|

Position-based automatic reverse engineering of network protocols

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
42
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 66 publications
(42 citation statements)
references
References 10 publications
0
42
0
Order By: Relevance
“…(1) Input: observation , frequency threshold Γ (2) Output: closed frequent string set L (3) # Find out the frequent strings (4) Initialization: frequent candidate set 1 = Σ, = 1 (5) while ̸ = do (6) # Check frequency of strings in (7) for ∈ do (8) # Freq( ) is the frequency of in (9) if Freq( ) < Γ then (10) Delete from (11) end if (12) end for (13) # end if (20) end for (21) = + 1; (22) end while (23) # Find out the closed frequent strings (24) Initialization: = 1 (25) while +1 ̸ = do (26) for 1 ∈ do (27) for 2 ∈ +1 do (28) # delete the substrings (29) if 1 ⊂ 2 then (30) Delete 1 from (31) Break (32) end if (33) end for (34) end for (35) Update L = L ∪ (36) = + 1 (37) end while (38) Update L = L ∪ Algorithm 1: Closed frequent string algorithm.…”
Section: System Overviewmentioning
confidence: 99%
See 1 more Smart Citation
“…(1) Input: observation , frequency threshold Γ (2) Output: closed frequent string set L (3) # Find out the frequent strings (4) Initialization: frequent candidate set 1 = Σ, = 1 (5) while ̸ = do (6) # Check frequency of strings in (7) for ∈ do (8) # Freq( ) is the frequency of in (9) if Freq( ) < Γ then (10) Delete from (11) end if (12) end for (13) # end if (20) end for (21) = + 1; (22) end while (23) # Find out the closed frequent strings (24) Initialization: = 1 (25) while +1 ̸ = do (26) for 1 ∈ do (27) for 2 ∈ +1 do (28) # delete the substrings (29) if 1 ⊂ 2 then (30) Delete 1 from (31) Break (32) end if (33) end for (34) end for (35) Update L = L ∪ (36) = + 1 (37) end while (38) Update L = L ∪ Algorithm 1: Closed frequent string algorithm.…”
Section: System Overviewmentioning
confidence: 99%
“…The first challenge in our research is to determine the length of protocol keywords. Previous works [7][8][9][10][11][12] which are based on longest common subsequence (LCS) criteria select longest frequent substrings to be protocol keywords. For example, if "G", "E", "T", "GE", "ET", and "GET" are frequent substrings, "GET" will be chosen as the protocol keyword, since it is the longest substring.…”
Section: Introductionmentioning
confidence: 99%
“…The parameters and procedures are the same as Section 7.1. The grouped messages are taken as input into AutoReEngine [4] to extract protocol keywords. The protocol keywords extracted by AutoReEngine are shown in Table 3.…”
Section: Message Grouping For Improving Protocol Reverse Engineeringmentioning
confidence: 99%
“…Network protocol reverse engineering [1][2][3][4] is a promising approach to address the problem of recovering detailed specifications of unpublished or undocumented network protocols from the network trace. The specifications of protocols play an important role in the network security and management oriented issues, such as intrusion detection, fuzzing test [5], recovering and understanding command-and-command (C&C) protocols [6], and building intelligent honeypot [7].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation