md5bloom: Forensic filesystem hashing revisited

Digital Investigation

Volumn 3, Issue SUPPL., 2006, Pages 82-90

  Roussev, Vassil ^a   Chen, Yixin ^a   Bourg, Timothy ^a   Richard III, Golden G ^a  

^a USA   (United States)

Author keywords

Bloom filters; Digital forensics; Filesystem investigation; md5bloom; Similarity hashing

Indexed keywords

COMPUTER SOFTWARE; DIGITAL FILTERS; ERROR CORRECTION; FILE ORGANIZATION; ONLINE SEARCHING; PROBABILISTIC LOGICS; SECURITY OF DATA;

BLOOM FILTERS; DIGITAL FORENSICS; FILESYSTEM INVESTIGATION; MD5BLOOM; SIMILARITY HASHING;

COMPUTER CRIME;

EID: 33746014654     PISSN: 17422876     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.diin.2006.06.012     Document Type: Article

References (16)

1. Aguilera M, Ji M, Lillibridge M, MacCormick J, Oertli E, Anderson D, et al. Block-level security for network attached disks. In: Proceedings of the second Usenix conference on file and storage technologies; 2003.
2. Bellovin S, Cheswick W. Privacy-enhanced searches using encrypted bloom filters, draft paper, in preparation.
3. Bloom B. Space/time tradeoffs in hash coding with allowable errors. Communications of the ACM 13 7 (1970) 422-426
4. Broder A., and Mitzenmacher M. Network applications of bloom filters: a survey. Internet Mathematics 1 4 (2005) 485-509
5. Dharmapurikar S, Attig M, Lockwood J. Design and implementation of a string matching system for network intrusion detection using FPGA-based bloom filters. Washington University in St. Louis, Computer Science Technical Report WUCSE-2004-12; 2004.
6. Dharmapurikar S, Krishnamurthy P, Taylor D. Longest prefix matching using bloom filters. IEEE Transactions on Networking, in press.
7. Estan C, Varghese G. New directions in traffic measurement and accounting. In: Proceedings of the 2001 ACM SIGCOMM internet measurement workshop; 2001.
8. Fan L., Cao P., Almeida J., and Broder A. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking 8 3 (2000) 281-293
9. Feng W-C, Shin K, Kandlur D, Saha D. Stochastic fair blue: a queue management algorithm for enforcing fairness. In: Proceedings of the twentieth annual joint conference of the IEEE computer and communications societies (INFOCOM 2001); 2001.
10. Ledlie J, Taylor J, Serban L, Seltzer M. Self-organization in peer-to-peer systems. In: Proceedings of the in tenth ACM SIGOPS European workshop; 2002.
11. U. Manber. Finding similar files in a large file system. In: Proceedings of the USENIX winter 1994 technical conference; Jan 1994. p. 1-10.
12. Mitzenmacher M. Compressed bloom filters. IEEE/ACM Transactions on Networks 10 5 (October 2002) 613-620
13. 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.
14. Spafford E. Opus: preventing weak password choices. Computer and Security 11 (1992) 273-278
15. Valdurez P., and Gardarin G. Join and semijoin algorithms for a multiprocessor database machine. ACM Transactions on Database Systems 9 1 (1984) 133-161
16. Whitaker A, Wetherall D. Forwarding without loops in icarus. In: Proceedings of the fifth IEEE conference on open architectures and network programming; 2002.