Share Email Print
cover

Proceedings Paper

General finite state machine reasoning method for digital forensics
Author(s): Long Chen; Guoyin Wang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Digital forensics investigator faces the challenge of reliability of forensic conclusions. Formal automatic analysis method is helpful to deal with the challenge. The finite state machine analysis method tries to determine all possible sequences of events that could have happened in a digital system during an incident. Its basic idea is to model the target system using a finite state machine and then explore its all possible states on the condition of available evidence. Timed mealy finite state machine is introduced to model the target system, and the formalization of system running process and evidence is presented to match the system running with possible source evidence automatically. Based on Gladyshev's basic reasoning method, general reasoning algorithms with multi strategies are developed to find the possible real scenarios. Case study and experimental results show that our method is feasible and adaptable to possible cases and takes a further step to practical formal reasoning for digital forensics.

Paper Details

Date Published: 3 April 2008
PDF: 12 pages
Proc. SPIE 6982, Mobile Multimedia/Image Processing, Security, and Applications 2008, 69820I (3 April 2008); doi: 10.1117/12.777879
Show Author Affiliations
Long Chen, Southwest JiaoTong Univ. (China)
Chongqing Univ. of Posts and Telecommunications (China)
Guoyin Wang, Southwest JiaoTong Univ. (China)
Chongqing Univ. of Posts and Telecommunications (China)


Published in SPIE Proceedings Vol. 6982:
Mobile Multimedia/Image Processing, Security, and Applications 2008
Sos S. Agaian; Sabah A. Jassim, Editor(s)

© SPIE. Terms of Use
Back to Top