Abstract
We discuss and compare robust hash functions for natural text with respect to their performance regarding text modification and natural language watermark embedding. Our goal is to identify algorithms suitable for efficiently identifying watermarked copies of eBooks before watermark detection.
Chapter PDF
Similar content being viewed by others
References
Hoffelder, N.: AAP Reports US eBook Sales Up 46% in 2012, Now Well Over a Fifth of US Book Market
Wolf, M.: E-book market forecast to hit $5.2B as the book industry burns
Wauters, R.: Total Mobile eBook Sales Forecast To Reach $10B By 2016; Now Close To 1 Million Books In Kindle Store
Kornblum, J.: Identifying almost identical files using context triggered piecewise hashing. Digital Investigation 3(S) (2006)
Broder, A., Glassman, S., Manasse, M., Zweig, G.: Syntactic Clustering of the Web. In: 6th International World Wide Web Conference, pp. 393–404 (April 1997)
Charikar, M.: Similarity estimation techniques from rounding algorithms. In: Proc. 34th Annual Symposium on Theory of Computing, STOC 2002, pp. 380–388 (2002)
Manku, G., Jain, A., Sarma, A.: Detecting near-duplicates for web crawling. In: Proceedings of the 16th International Conference on World Wide Web (2007)
Gabrilovich, E.: Wikipedia Preprocessor (WikiPrep), http://www.cs.technion.ac.il/~gabr/resources/code/wikiprep/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Steinebach, M., Klöckner, P., Reimers, N., Wienand, D., Wolf, P. (2013). Robust Hash Algorithms for Text. In: De Decker, B., Dittmann, J., Kraetzer, C., Vielhauer, C. (eds) Communications and Multimedia Security. CMS 2013. Lecture Notes in Computer Science, vol 8099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40779-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-40779-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40778-9
Online ISBN: 978-3-642-40779-6
eBook Packages: Computer ScienceComputer Science (R0)