md5bloom: Forensic filesystem hashing revisited

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. Bellovin S, Cheswick W. Privacy-enhanced searches using encrypted bloom filters, draft paper, in preparation. Bloom, 1970, Space/time tradeoffs in hash coding with allowable errors, Communications of the ACM, 13, 422, 10.1145/362686.362692 Broder, 2005, Network applications of bloom filters: a survey, Internet Mathematics, 1, 485, 10.1080/15427951.2004.10129096 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. Dharmapurikar S, Krishnamurthy P, Taylor D. Longest prefix matching using bloom filters. IEEE Transactions on Networking, in press. Estan C, Varghese G. New directions in traffic measurement and accounting. In: Proceedings of the 2001 ACM SIGCOMM internet measurement workshop; 2001. Fan, 2000, Summary cache: a scalable wide-area web cache sharing protocol, IEEE/ACM Transactions on Networking, 8, 281, 10.1109/90.851975 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. 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. U. Manber. Finding similar files in a large file system. In: Proceedings of the USENIX winter 1994 technical conference; Jan 1994. p. 1–10. Mitzenmacher, 2002, Compressed bloom filters, IEEE/ACM Transactions on Networks, 10, 613, 10.1109/TNET.2002.803864 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. Spafford, 1992, Opus: preventing weak password choices, Computer and Security, 11, 273, 10.1016/0167-4048(92)90207-8 Valdurez, 1984, Join and semijoin algorithms for a multiprocessor database machine, ACM Transactions on Database Systems, 9, 133, 10.1145/348.318590 Whitaker A, Wetherall D. Forwarding without loops in icarus. In: Proceedings of the fifth IEEE conference on open architectures and network programming; 2002.