An evaluation of forensic similarity hashes

DFRWS 2011 Annual Conference

Volumn 8, Issue , 2011, Pages

  Roussev, Vassil ^a  

^a USA   (United States)

Author keywords

Digital forensics; Sdhash; Similarity digest; Similarity hash; Ssdeep

Indexed keywords

COMPUTER CRIME; ELECTRONIC CRIME COUNTERMEASURES; FUZZY FILTERS;

CONTROLLED ENVIRONMENT; DIGITAL ARTIFACTS; RANDOM POLYNOMIALS; RECALL AND PRECISION; SDHASH; SIMILARITY DIGEST; SIMILARITY HASH; SSDEEP;

DIGITAL FORENSICS;

EID: 84868524967     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Bloom B. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 1970;13(7):422-6. Doi: 10.1145/362686.362692.
2. Broder A, Mitzenmatcher M. Network applications of bloom filters: a survey. In: Annual Allerton conference on communication, control, and computing, Urbana-champaign, Illinois, USA; October 2002.
3. Garfinkel S, Farrell P, Roussev V, Dinolt G. Bringing science to digital forensics with standardized forensic corpora. In: Proceedings of the digital forensic research conference (DFRWS); 2009. p. S2-11.
4. Kornblum J. Identifying almost identical files using context triggered piecewise hashing. Digital Investigation 2006;vol. 3(S1):S91-7.
5. Rabin M. Fingerprinting by random polynomials, technical report TR1581, center for research in computing technology. Cambridge, Massachusetts: Harvard University; 1981.
6. Roussev V. Building a better similarity trap with statistically improbable features. In: Proceedings of the 42nd Hawaii international conference on system sciences. Waikoloa Village Resort, Hawaii, HI: IEEE; Jan 2009.
7. Roussev V. Data fingerprinting with similarity digests. In: Chow K-P, Shenoi S, editors. Advances in digital forensics VI, IFIP AICT, 337; 2010. p. 207-25.