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

Management of stateful firewall misconfiguration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
15
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 21 publications
(15 citation statements)
references
References 20 publications
0
15
0
Order By: Relevance
“…A limitation of the approach is that their model does not distinguish rules with different state information, that is, for example, there is no differentiation between the establishment and termination phase of a given stateful protocol, and as a consequence, they do not consider more complex anomalies that may occur specifically in the stateful case. Cuppens et al [11] and García-Alfaro et al [23] propose an algorithmic approach to detect and resolve anomalies in a stateful firewall policy. A connection-oriented protocol is modelled using general automata, whereby the permitted protocol states and transitions are encoded.…”
Section: Table 18mentioning
confidence: 99%
“…A limitation of the approach is that their model does not distinguish rules with different state information, that is, for example, there is no differentiation between the establishment and termination phase of a given stateful protocol, and as a consequence, they do not consider more complex anomalies that may occur specifically in the stateful case. Cuppens et al [11] and García-Alfaro et al [23] propose an algorithmic approach to detect and resolve anomalies in a stateful firewall policy. A connection-oriented protocol is modelled using general automata, whereby the permitted protocol states and transitions are encoded.…”
Section: Table 18mentioning
confidence: 99%
“…There exist in the literature many proposals to resolve these problems [25]. We consider that developing new algorithms is out of the scope of this paper.…”
Section: B Data Preprocessingmentioning
confidence: 99%
“…QueryInterval ← Exclusion for all r ∈ Rules do 18: if Decision = ∅ then Output ← Output ∪ {Interval, Rules, Decision} 25: return Output False (lines [8][9][10]), then the corresponding rule is stored added to Rules, meaning that the predicate of such a rule matches the query interval. Similarly, the non-overlapping portion of the query interval with P redicate r is stored in Exclusion (line 7), representing portions in QueryInterval unmatched by rule r. If Exclusion is not False, then some more portions in QueryInterval still require being processed.…”
mentioning
confidence: 99%
“…Algorithm 1, lines [8][9][10][11]), it is computed the query space Q B . Using Q B , decision spaces D AB and D BB (associated to Q B ) are obtained by applying, respectively, ACLs A and B.…”
mentioning
confidence: 99%
See 1 more Smart Citation