2010
DOI: 10.1007/978-3-642-11534-9_9
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of Evidence Using Formal Event Reconstruction

Abstract: This paper expands upon the finite state machine approach for the formal analysis of digital evidence. The proposed method may be used to support the feasibility of a given statement by testing it against a relevant system model. To achieve this, a novel method for modeling the system and evidential statements is given. The method is then examined in a case study example.Comment: 10 pages, 11 figures, Presented at the 1st International Conference on Digital Forensics & Cyber Crim

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
20
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 23 publications
(20 citation statements)
references
References 5 publications
0
20
0
Order By: Relevance
“…These automatic extractors, a widely used concept, can also generate the timeline as in FORE (Schatz et al, 2004), FACE (Case et al, 2008), CyberForensic TimeLab (Olsson and Boldt, 2009), Plaso and PyDFT (Hargreaves and Patterson, 2012). However, in some approaches including (Gladyshev and Patel, 2004) and (James et al, 2010), the lack of automation seems difficult to address and they present very high complexity (combinatorial explosion).…”
Section: Data Volumementioning
confidence: 97%
See 1 more Smart Citation
“…These automatic extractors, a widely used concept, can also generate the timeline as in FORE (Schatz et al, 2004), FACE (Case et al, 2008), CyberForensic TimeLab (Olsson and Boldt, 2009), Plaso and PyDFT (Hargreaves and Patterson, 2012). However, in some approaches including (Gladyshev and Patel, 2004) and (James et al, 2010), the lack of automation seems difficult to address and they present very high complexity (combinatorial explosion).…”
Section: Data Volumementioning
confidence: 97%
“…Second, the use of finite state machine is very time consuming when used in real case. (James et al, 2010) propose to convert the finite state machine into a deterministic finite state machine to limit the exponential growth of the size of the machine and therefore the number of scenarii to examine during the backtracking algorithm. Despite the reduction in size of the state machine, the experiments show that the approach still not be able to be used on real forensic cases.…”
Section: Data Volumementioning
confidence: 99%
“…Generally speaking, the cache needs 4 MB or one percent of the logical drive size, depending on which is greater. In order to identify the correct location of the cache for each user under Windows, the registry hive for the particular user must be examined for some cases [12,16].…”
Section: Literature Reviewsmentioning
confidence: 99%
“…Examples of investigation graphs consist primarily of scenario graphs, forensics graphs, logic exploitation graphs, attack graphs, and evidence graphs [6]. The digital systems can be described mathematically as a finite state machine and can represents this information in the form of a graph (nodes and arrows) [7]. Figure 1 shows the cyber-crime management chain, it consists of four stages namely; proactive (readiness), active, reactive and awareness.…”
Section: Introductionmentioning
confidence: 99%