B. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970.
DOI : 10.1145/362686.362692

S. Brin, J. Davis, and H. Garcia-molina, Copy detection mechanisms for digital documents, Proceedings of the ACM SIGMOD International Conference on Management of Data, pp.398-409, 1995.
DOI : 10.1145/223784.223855

A. Broder, S. Glassman, M. Manasse, and G. Zweig, Syntactic clustering of the Web, Computer Networks and ISDN Systems, vol.29, issue.8-13, pp.8-13, 1997.
DOI : 10.1016/S0169-7552(97)00031-7

A. Broder and M. Mitzenmacher, Network Applications of Bloom Filters: A Survey, Internet Mathematics, vol.1, issue.4, pp.485-509, 2005.
DOI : 10.1080/15427951.2004.10129096

C. Cho, S. Lee, C. Tan, and Y. Tan, Network Forensics on Packet Fingerprints, Proceedings of the Twenty-First IFIP Information Security Conference, pp.401-412, 2006.
DOI : 10.1007/0-387-33406-8_34
URL : http://security.dso.org.sg/files/pub/network forensics on packet fingerprints.pdf

J. Kornblum, Identifying almost identical files using context triggered piecewise hashing, Digital Investigation, pp.91-97, 2006.
DOI : 10.1016/j.diin.2006.06.015

U. Manber, Finding similar files in a large file system, Proceedings of the USENIX Winter Technical Conference, pp.1-10, 1994.

M. Mitzenmacher, Compressed Bloom filters, IEEE/ACM Transactions on Networking, vol.10, issue.5, pp.604-612, 2002.
DOI : 10.1109/TNET.2002.803864
URL : http://www.eecs.harvard.edu/~michaelm/NEWWORK/postscripts/cbf2.ps

M. Ponec, P. Giura, H. Bronnimann, and J. Wein, Highly efficient techniques for network forensics, Proceedings of the 14th ACM conference on Computer and communications security , CCS '07, pp.150-160, 2007.
DOI : 10.1145/1315245.1315265
URL : http://isis.poly.edu/~fornet/docs/pubs/ccs097-ponec.pdf

H. Pucha, D. Andersen, and M. Kaminsky, Exploiting similarity for multi-source downloads using file handprints, Proceedings of the Fourth USENIX Symposium on Networked Systems Design and Implementation, pp.15-28, 2007.

M. Rabin, Fingerprinting by Random Polynomials, 1981.

S. Rhea, K. Liang, and E. Brewer, Value-based web caching, Proceedings of the twelfth international conference on World Wide Web , WWW '03, pp.619-628, 2003.
DOI : 10.1145/775152.775239

V. Roussev, Building a better similarity trap with statistically improbable features, Proceedings of the Forty-Second Hawaii International Conference on System Sciences, pp.1-10, 2009.

V. Roussev, Hashing and Data Fingerprinting in Digital Forensics, IEEE Security & Privacy Magazine, vol.7, issue.2, pp.49-55, 2009.
DOI : 10.1109/MSP.2009.40

V. Roussev, G. Richard, and L. Marziale, Multi-resolution similarity hashing, Digital Investigation, pp.105-113, 2007.
DOI : 10.1016/j.diin.2007.06.011

V. Roussev, G. Richard, and L. Marziale, Class-Aware Similarity Hashing for Data Classification, Research Advances in Digital Forensics IV, pp.101-113, 2008.
DOI : 10.1007/978-0-387-84927-0_9

S. Schleimer, D. Wilkerson, and A. Aiken, Winnowing, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, pp.76-85, 2003.
DOI : 10.1145/872757.872770

K. Shanmugasundaram, H. Bronnimann, and N. Memon, Payload attribution via hierarchical bloom filters, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.31-41, 2004.
DOI : 10.1145/1030083.1030089