Skip to main content
Conference ProceedingsOPEN ACCESS

Robust hash algorithms for text

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8099 LNCS 135-144
DOI: 10.1007/978-3-642-40779-6_11
8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © IFIP International Federation for Information Processing 2013.

Author supplied keywords

Cite

CITATION STYLE

APA

Steinebach, M., Klöckner, P., Reimers, N., Wienand, D., & Wolf, P. (2013). Robust hash algorithms for text. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8099 LNCS, pp. 135–144). https://doi.org/10.1007/978-3-642-40779-6_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free