Hash-Based File Content Identification Using Distributed Systems

1Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A major challenge in digital forensics is the handling of very large amounts of data. Since forensic investigators often have to analyze several terabytes of data in a single case, efficient and effective tools for automatic data identification and filtering are required. A common data identification technique is to match the cryptographic hashes of files with hashes stored in blacklists and whitelists in order to identify contraband and harmless content, respectively. However, blacklists and whitelists are never complete and they miss most of the files encountered in investigations. Also, cryptographic hash matching fails when file content is altered even very slightly. This paper analyzes several distributed systems for their ability to support file content identification. A framework is presented for automated file content identification that searches for file hashes and collects, aggregates and presents the search results. Experiments demonstrate that the framework can provide identifying information for 26% of the test files from their hashed content, helping reduce the workload of forensic investigators. © IFIP International Federation for Information Processing 2013.

Cite

CITATION STYLE

APA

Yannikos, Y., Schluessler, J., Steinebach, M., Winter, C., & Graffi, K. (2013). Hash-Based File Content Identification Using Distributed Systems. In IFIP Advances in Information and Communication Technology (Vol. 410, pp. 119–134). Springer New York LLC. https://doi.org/10.1007/978-3-642-41148-9_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free