Expediting MRSH-v2 Approximate Matching with Hierarchical Bloom Filter Trees

Details

Serval ID
serval:BIB_CDA3425AB7ED
Type
Inproceedings: an article in a conference proceedings.
Collection
Publications
Title
Expediting MRSH-v2 Approximate Matching with Hierarchical Bloom Filter Trees
Title of the conference
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
Author(s)
Lillis David, Breitinger Frank, Scanlon Mark
Publisher
Springer International Publishing
Address
Cham
ISBN
9783319736969
9783319736976
ISSN
1867-8211
1867-822X
Publication state
Published
Issued date
2018
Editor
Matoušek Petr, Schmiedecker Martin
Pages
144-157
Language
english
Abstract
Perhaps the most common task encountered by digital forensic investigators consists of searching through a seized device for pertinent data. Frequently, an investigator will be in possession of a collection of “known-illegal” files (e.g. a collection of child pornographic images) and will seek to find whether copies of these are stored on the seized drive. Traditional hash matching techniques can efficiently find files that precisely match. However, these will fail in the case of merged files, embedded files, partial files, or if a file has been changed in any way.
Keywords
approximate matching, hierarchical bloom filter trees, mrsh-v2
Create date
06/05/2021 12:01
Last modification date
06/05/2021 12:47
Usage data