2008 · 15 citations · 9 references
ComputingComputer ScienceComputer SystemsComputer SecurityDigital ForensicsStorage SystemsData Storage SystemsDistributed StorageFile System AnalysisFile SystemsHash TablesStorage SecurityBloom FiltersFile Hash AnalysisHard Disk DrivesHash Function AttacksHashingReference Set ConstructionReference Set ManagementStorage Capacity
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.
9
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text
Network Applications of Bloom Filters: A Survey
Andrei Broder, Michael Mitzenmacher · Internet Mathematics · 2004 · 2K citations · Full text
Properties of the working-set model
Peter J. Denning, S.C. Schwartz · Communications of the ACM · 1972 · 232 citations · Full text
Michael Mitzenmacher · 2001 · 200 citations