Evaluating detection error trade-offs for bytewise approximate matching algorithms
| Autor: | Georgios Stivaktakis, Frank Breitinger, Vassil Roussev |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Computer science
Digital forensics Hash function computer.software_genre Computer Science Applications Set (abstract data type) Medical Laboratory Technology Approximate matching Cryptographic hash function Data mining Representation (mathematics) Precision and recall Law Algorithm computer Complement (set theory) |
| Zdroj: | Digital Investigation. 11:81-89 |
| ISSN: | 1742-2876 |
| DOI: | 10.1016/j.diin.2014.05.002 |
| Popis: | Bytewise approximate matching is a relatively new area within digital forensics, but its importance is growing quickly as practitioners are looking for fast methods to analyze the increasing amounts of data in forensic investigations. The essential idea is to complement the use of cryptographic hash functions to detect data objects with bytewise identical representation with the capability to find objects with bytewise similar representations. Unlike cryptographic hash functions, which have been studied and tested for a long time, approximate matching ones are still in their early development stages, and have been evaluated in a somewhat ad-hoc manner. Recently, the FRASH testing framework has been proposed as a vehicle for developing a set of standardized tests for approximate matching algorithms; the aim is to provide a useful guide for understanding and comparing the absolute and relative performance of different algorithms. The contribution of this work is twofold: a) expand FRASH with automated tests for quantifying approximate matching algorithm behavior with respect to precision and recall; and b) present a case study of two algorithms already in use-sdhash and ssdeep. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect