Multi-resolution similarity hashing

DFRWS 2007 Annual Conference

Volumn , Issue , 2007, Pages

  Roussev, Vassil ^a   Richard III, Golden G ^a   Marziale, Lodovico ^a  

^a The Research Institute for Children   (United States)

Author keywords

Data correlation; Digital forensics; File correlation; Hashing; Multi resolution hash; Similarity hashing

Indexed keywords

DATA CORRELATIONS; DIGITAL FORENSIC; HASHING; MULTI-RESOLUTIONS; SIMILARITY HASHING;

ELECTRONIC CRIME COUNTERMEASURES;

EID: 65249183010     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/j.diin.2007.06.011     Document Type: Conference Paper

References (18)

1. Bloom B. Space/time tradeoffs in hash coding with allowable errors. Commun ACM 1970;13(7):422-6.
2. Brin S, Davis J, Garcia-Molina H. Copy detection mechanisms for digital documents. In: Proceedings of the ACM SIGMOD annual conference, San Francisco, CA, May 1995.
3. Broder A, Mitzenmacher M. Network applications of bloom filters: a survey. Internet Math 2005;1(4):485-509.
4. Broder A, Glassman S, Manasse M, Zweig G. Syntactic clustering of the web. In: Proceedings of the 6th international world wide web conference, 1997. p. 393-404.
5. Charikar MS. Similarity estimation techniques from rounding algorithms. In: Proceedings of the 34th annual ACM symposium on theory of computing, 2002.
6. Dean J, Ghemawat S. MapReduce: simplified data processing on large clusters. In: Proceedings of the sixth symposium on operating system design and implementation, 2004.
7. Henziger M. Finding near-duplicate web pages: a large-scale evaluation of algorithms. In: Proceedings of the 29th annual international ACM SIGIR conference on research and development on information retrieval, Seattle, 2006.
8. Karp R, Rabin M. Efficient randomized pattern-matching algorithms. IBM J Res Dev 1987;31(2):249-60.
9. Kornblum J. Identifying almost identical files using context triggered piecewise hashing. In: Proceedings of the 6th annual DFRWS, Lafayette, IN, Aug 2006.
10. Mitzenmacher M. Compressed bloom filters. IEEE/ACM Trans Netw October 2002;10(5):613-20.
11. Monostori K, Finkel R, Zaslavsky A, Hodasz G, Pataki M. Comparison of overlap detection techniques. In: Proceedings of the 2002 international conference on computational science (I), Amsterdam, The Netherlands, 2002. p. 51-60.
12. Roussev V, Richard III GG. Breaking the performance wall: the case fordistributeddigital forensics. In: Proceedings of the 2004digital forensics research workshop (DFRWS 2004), Baltimore, MD.
13. Roussev V, Chen Y, Bourg T, Richard III GG. md5bloom: forensic filesystem hashing revisited. In: Proceedings of the 6th annual DFRWS, Lafayette, IN, Aug 2006.
14. Shanmugasundaram K, Bronnimann H, Memon N. Payload attribution via hierarchical bloom filters. In: Proceedings of the ACM symposium on communication and computer security (CCS'04), 2004.
15. Shivakumar N, Garcia-Molina H. SCAM: a copy detection mechanism for digital documents. In: Proceedings of the international conference on theory and practice of digital libraries, June 1995.
16. Shivakumar N, Garcia-Molina H. Building a scalable and accurate copy detection mechanism. In: Proceedings of the ACM conference on digital libraries, March 1996. p. 160-8.
17. Shivakumar N, Garcia-Molina H. Finding near-replicas of documents on the web. In: Proceedings of the workshop on web databases, March 1998. p. 204-12.
18. Tridgell A. Spamsum README. 〈http://samba.org/ftp/unpacked/junkcode/ spamsum/README〉; 2002.