Practical Applications of Bloom Filters to the NIST RDS and Hard Drive Triage

Authors:
Paul Farrell;Simson L. Garfinkel;Douglas White
Affiliations:
-;-;-
Venue:
ACSAC '08 Proceedings of the 2008 Annual Computer Security Applications Conference
Year:
2008

Citing 0
Cited 2

Using purpose-built functions and block hashes to enable small block and sub-file forensics

Digital Investigation: The International Journal of Digital Forensics & Incident Response
Lessons learned from the construction of a Korean software reference data set for digital forensics

Digital Investigation: The International Journal of Digital Forensics & Incident Response

Quantified Score

Hi-index	0.00

Visualization

Abstract

Much effort has been expended in recent years to create large sets of hash codes from known files. Distributing these sets has become more difficult as these sets grow larger. Meanwhile the value of these sets for eliminating the need to analyze "known goods'' has decreased as hard drives have dramatically increased in storage capacity. This paper evaluates the use of Bloom filters (BFs) to distribute the National Software Reference Library's (NSRL) Reference Data Set (RDS)version 2.19, with 13 million SHA-1 hashes. We present an open source reference BF implementation and validate it against a large collection of disk images. We discuss the tuning of the filters, evaluate discuss how they can be used to enable new forensic functionality, and present a novel attack against bloom filters.