This article explores a novel approach to file carving by viewing it as a decision problem. This allows us to design algorithms that produce best-effort results under given resource constraints. Resource-constrained carving is important for digital forensic triage, as well as for e-discovery, where a reduction in carving time may be preferred to completeness. In this work Pavel Gladyshev and Joshua I. James give a formal definition of decision-theoretic file carving. As an illustration, they developed a JPEG file carving tool using the described decision-theoretic algorithm. The authors then examine the results of decision-theoretic file carving compared with linear carving methods to demonstrate when decision-theoretic carving is most useful.

1-s2.0-S1742287617301329-main.compressed
Load More Related Articles
Load More In Science

Leave a Reply

Your email address will not be published. Required fields are marked *