Md5bloom: Forensic filesystem hashing revisited

Digital Forensic Research Workshop 2006

Volumn , Issue , 2006, Pages

  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

BLOOM FILTERS; DIGITAL FORENSIC; FILESYSTEM; MD5BLOOM; SIMILARITY HASHING;

ELECTRONIC CRIME COUNTERMEASURES;

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

References (15)

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. Bloom B. Space/time tradeoffs in hash coding with allowable errors. Communications of the ACM 1970;13(7):422-6.
3. Broder A, Mitzenmacher M. Network applications of bloom filters: a survey. Internet Mathematics 2005;1(4):485-509.
4. Dharmapurikar S, Attig M, Lockwood J. Design and implementation of a stringmatching systemfor network intrusion detection usingFPGA- basedbloomfilters.WashingtonUniversityinSt. Louis, Computer Science Technical ReportWUCSE-2004-12; 2004.
5. Dharmapurikar S, Krishnamurthy P, Taylor D. Longest prefix matching using bloom filters. IEEE Transactions on Networking, in press.
6. Estan C, Varghese G. New directions in traffic measurement and accounting. In: Proceedings of the 2001 ACM SIGCOMM internet measurement workshop; 2001.
7. Fan L, Cao P, Almeida J, Broder A. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking 2000;8(3):281-93.
8. 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.
9. Ledlie J, Taylor J, Serban L, Seltzer M. Self-organization in peer-topeer systems. In: Proceedings of the in tenth ACM SIGOPS European workshop; 2002.
10. U. Manber. Finding similar files in a large file system. In: Proceedings of the USENIX winter 1994 technical conference; Jan 1994. p. 1-10.
11. Mitzenmacher M. Compressed bloom filters. IEEE/ACM Transactions on Networks October 2002;10(5):613-20.
12. 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.
13. Spafford E. Opus: preventing weak password choices. Computer and Security 1992;11:273-8.
14. Valdurez P, Gardarin G. Join and semijoin algorithms for a multiprocessor database machine. ACM Transactions on Database Systems 1984;9(1):133-61. (Pubitemid 14551877)
15. Whitaker A, Wetherall D. Forwarding without loops in icarus. In: Proceedings of the fifth IEEE conference on open architectures and network programming; 2002.