Title :
A Complexity Based Model for Quantifying Forensic Evidential Probabilities
Author :
Overill, Richard E. ; Silomon, Jantje A M ; Chow, K.P.
Author_Institution :
Dept. of Comput. Sci., King´´s Coll. London, London, UK
Abstract :
An operational complexity model (OCM) is proposed to enable the complexity of both the cognitive and the computational components of a process to be determined. From the complexity of formation of a set of traces via a specified route a measure of the probability of that route can be determined. By determining the complexities of alternative routes leading to the formation of the same set of traces, the odds ratio indicating the relative plausibility of the alternative routes can be found. An illustrative application to a BitTorrent piracy case is presented, and the results obtained suggest that the OCM is capable of providing a realistic estimate of the odds ratio for two competing hypotheses. It is also demonstrated that the OCM can be straightforwardly refined to encompass a variety of circumstances.
Keywords :
computational complexity; computer forensics; probability; BitTorrent piracy case; alternative routes complexity; cognitive components; computational components; forensic evidential probability; operational complexity model; relative plausibility; Availability; Bayesian methods; Computational complexity; Computer science; Computer security; Digital forensics; Educational institutions; Humans; Performance evaluation; Thermodynamics; competing hypotheses; digital forensics; evidential probability; odds ratio; operational complexity model; posterior probability;
Conference_Titel :
Availability, Reliability, and Security, 2010. ARES '10 International Conference on
Conference_Location :
Krakow
Print_ISBN :
978-1-4244-5879-0
DOI :
10.1109/ARES.2010.42