The results of the evidence analysis phase in Digital Forensics (DF) provide objective data which however require further elaboration by the investigators: in fact, they must contextualize analysis results within an investigative environment so as to provide possible hypotheses that can be proposed as proofs in court, to be evaluated by lawyers and judges. Aim of our research has been that of exploring the applicability of Answer Set Programming (ASP) to the automatization of evidence analysis. This brings many advantages, among which that of making different possible investigative hypotheses explicit, whereas different human experts working on the case often devise and select, relying on intuition, discordant interpretations. Very complex investigations for which human experts can hardly find solutions turn out in fact to be reducible to optimization problems in classes P or NP or not far beyond, that can thus be expressed in ASP. As a proof of concept, in this paper we present the formulation of some real investigative cases via simple ASP programs, and discuss how this leads to the formulation of concrete investigative hypotheses.

Digital Forensics Evidence Analysis: An Answer Set Programming Approach for Generating Investigation Hypotheses

COSTANTINI, STEFANIA;DE GASPERIS, GIOVANNI;
2015-01-01

Abstract

The results of the evidence analysis phase in Digital Forensics (DF) provide objective data which however require further elaboration by the investigators: in fact, they must contextualize analysis results within an investigative environment so as to provide possible hypotheses that can be proposed as proofs in court, to be evaluated by lawyers and judges. Aim of our research has been that of exploring the applicability of Answer Set Programming (ASP) to the automatization of evidence analysis. This brings many advantages, among which that of making different possible investigative hypotheses explicit, whereas different human experts working on the case often devise and select, relying on intuition, discordant interpretations. Very complex investigations for which human experts can hardly find solutions turn out in fact to be reducible to optimization problems in classes P or NP or not far beyond, that can thus be expressed in ASP. As a proof of concept, in this paper we present the formulation of some real investigative cases via simple ASP programs, and discuss how this leads to the formulation of concrete investigative hypotheses.
978-3-319-23263-8
978-3-319-23264-5
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11697/91293
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
social impact