Skip to content

Approximate matching using Hierarchical Bloom Filter Trees. Based on mrsh-v2.

License

Notifications You must be signed in to change notification settings

ishnid/mrsh-hbft

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

mrsh-hbft

Approximate matching using Hierarchical Bloom Filter Trees. Based on mrsh-v2 by Frank Breitinger.

Relevant Publications

D. Lillis, F. Breitinger, M. Scanlon, Expediting MRSH-v2 Approximate Matching with Hierarchical Bloom Filter Trees. In: Matoušek P., Schmiedecker M. (eds) Digital Forensics and Cyber Crime. ICDF2C 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineer- ing, vol 216. Springer, Cham, 2018 (doi: 10.1007/978-3-319-73697-6_11).

D. Lillis, F. Breitinger and M. Scanlon. Hierarchical Bloom Filter Trees for Approximate Matching. Journal of Digital Forensics, Security and Law (JDFSL), 13(1), 2018 (doi: 10.15394/jdfsl.2018.1489).

About

Approximate matching using Hierarchical Bloom Filter Trees. Based on mrsh-v2.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published