A Complexity Based Model for Quantifying Forensic Evidential Probabilities

Overill, Richard E.; Silomon, Jantje A. M.; Chow, Kam-Pui

doi:10.1109/ares.2010.42

Cited by 10 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Prosecutions for the possession of illegally downloaded digital material have caused serious problems for both digital forensic examiners and prosecution authorities alike for well over a decade. In previous studies based upon complexity theory [ 1 – 5 ] the plausibility of the Trojan Horse Defence [ 6 – 10 ] has been analysed. This defence has been successfully employed against prosecutions for the possession of large quantities child pornography (CP) images [ 11 , 12 ], but it also applies to images of terrorist material or espionage-related documents.…”

Section: Introductionmentioning

confidence: 99%

An approach to quantifying the plausibility of the inadvertent download defence

Overill

Chow

2016

Forensic Sciences Research

Self Cite

View full text Add to dashboard Cite

A table of 95% confidence limits on the probabilities for randomly downloading relatively small numbers of illegal images or sensitive documents amongst a relatively large number of other images or documents has been computed. It is anticipated that these data will assist prosecution officials in arriving at a decision as to whether or not there is a reasonable likelihood of a successful criminal prosecution when the inadvertent download defence is employed in cases of possession of child pornography, terrorist material or espionage-related documents. The same data can also be used by defence counsels to assess the strength of the prosecution's case.

show abstract

Section: Introductionmentioning

confidence: 99%

An approach to quantifying the plausibility of the inadvertent download defence

Overill

Chow

2016

Forensic Sciences Research

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, modifying the system time needs only an email client, and the operation needs simple steps;  L2: The operation needs some time and resource and the OC<10 10 . For example, using telnet command to falsify the email address needs little resources, and the operational step is complex and time-consuming;  L3: The operation needs much more resource and the OC<10 11 . For example, stealing other"s password not only needs many resources but the operational step is more complex and time-consuming.…”

Section: B the Classification Of Strategiesmentioning

confidence: 99%

A Game Theoretic Framework for E-Mail Detection and Forgery Analysis

Chen¹,

Lou²,

Xiao³

et al. 2016

ijacsa

View full text Add to dashboard Cite

Abstract-In email forensic, the email detection and forgery conflict is an interdependent strategy selection process, and there exists complex dynamics between the detector and the forger, who have conflicting objectives and influence each other's performance and decisions. This paper aims to study their dynamics from the perspective of game theory .We firstly analyze the email basic structure and header information, then discuss the email detection and forgery technologies. In this paper, we propose a Detection-Forgery Game (DFG) model and make a classification of players' strategy with the Operation Complexity (OC). In the DFG model, we regard the interactions between the detector and the forger as a two-player, non-cooperative, nonzero-sum and finite strategic game, and formulate the Nash Equilibrium. The optimal detection and forgery strategies with minimizing cost and maximizing reward will be found by using the model. Finally, we perform empirical experiments to verify the effectiveness and feasibility of the model.

show abstract

“…Some of the related works to forensic science involve mathematical and computational methods but the authors do not mentioned specifically its relationship either with DSS concepts or frameworks for DSS [1]- [3]. In the case study presented in this paper, the changes that will be applied are evolving from the Bayesian networks (BN) into Object-oriented Bayesian networks (OOBN).…”

mentioning

confidence: 99%

Evolutionary Framework of a Decision Support System for Forensic DNA Analysis

Noor¹,

Ghazali²,

Saman³

et al. 2014

LNSE

View full text Add to dashboard Cite

Abstract-Research trend in DSS has moved from the issue of DSS development into DSS evolution. Initial works has been done in 1980's but further research has not been done continuously. The evolution issue of DSS has gained interests again; hence the focus in this research is mainly about evolution decision support systems (DSS) especially from the state-of-art of the proposed frameworks. Chosen area of interest to be demonstrated in solving problems for the evolution of DSS frameworks in this paper is in domain forensic science, or more specifically, forensic DNA analysis. DSS frameworks for forensic science are explored first. From the literatures, it shows that there are significant lacks of available research works for evolution of a DSS in many areas of interests, and not only in forensic science. Types of frameworks for a DSS in general are studied and summaries are presented. The proposed evolutionary framework for a DSS in forensic DNA analysis is initiated.

show abstract

A Complexity Based Model for Quantifying Forensic Evidential Probabilities

Cited by 10 publications

References 7 publications

An approach to quantifying the plausibility of the inadvertent download defence

An approach to quantifying the plausibility of the inadvertent download defence

A Game Theoretic Framework for E-Mail Detection and Forgery Analysis

Evolutionary Framework of a Decision Support System for Forensic DNA Analysis

Contact Info

Product

Resources

About