|
|
|
     |
                                     |
Return to Data Security and Protection
Digital content is for copying: quotation, revision, plagiarism, and file sharing all create copies. Document fingerprinting is concerned with accurately identifying copying, including small partial copies, within large sets of documents. We introduce the class of local document fingerprinting algorithms, which seems to capture an essential property of any fingerprinting technique guaranteed to detect copies. We prove a novel lower bound on the performance of any local algorithm. We also develop winnowing, an efficient local fingerprinting algorithm, and show that winnowing's performance is within 33% of the lower bound. Finally, we also give experimental results on Web data, and report experience with MOSS, a widely-used plagiarism detection service.
@inproceedings {DBLP:conf/sigmod/SchleimerWA03, author = {Saul Schleimer and Daniel Shawcross Wilkerson and Alexander Aiken}, booktitle = {SIGMOD Conference}, title = {Winnowing: Local Algorithms for Document Fingerprinting.}, pages = {76-85}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#SchleimerWA03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r04p01.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
