2012
DOI: 10.1007/978-3-642-31909-9_2
|View full text |Cite
|
Sign up to set email alerts
|

An On-Line Learning Statistical Model to Detect Malicious Web Requests

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 14 publications
0
10
0
Order By: Relevance
“…Hidden Markov model web (HMM-Web) [42] instruments multiple hidden Markov models to analyze URI paths observed in HTTP GET requests. Lampesberger et al [105,106] propose an anomaly detection system for URI paths in web requests based on a variable-order Markov model that continuously learns without a separate training phase.…”
Section: Anomaly Detection In Web Interactionmentioning
confidence: 99%
See 1 more Smart Citation
“…Hidden Markov model web (HMM-Web) [42] instruments multiple hidden Markov models to analyze URI paths observed in HTTP GET requests. Lampesberger et al [105,106] propose an anomaly detection system for URI paths in web requests based on a variable-order Markov model that continuously learns without a separate training phase.…”
Section: Anomaly Detection In Web Interactionmentioning
confidence: 99%
“…The network monitor reconstructs complete or prefixes of higher-layer transmissions from packet traces collected from the network communication between a client and a service [105,106]. Reassembly needs to consider properties of higher-level protocols; in particular, TCP segments can be out of order.…”
Section: Network Layermentioning
confidence: 99%
“…In the context of software systems, formal verification can be regarded as a decision problem [105]. Namely, if it is given a programming language L and a formal language F suitable to express properties of programs in L (e.g., completeness, soundness, compactness, liveness, and safety and halting problems), the problem of verifying L programs against F properties can be considered as follows [105]:…”
Section: The Problem Of Verificationmentioning
confidence: 99%
“…Although there exists some artificial subset of formal languages which are extended with some (first-order) logics and for which the above problem is always decidable (e.g., sequential nullary ASMs conjugated with a first-order branching temporal logic [105]), their computational power and expressiveness are limited.…”
Section: The Problem Of Verificationmentioning
confidence: 99%
See 1 more Smart Citation