Robust Hash Algorithms for Text - Communications and Multimedia Security
Conference Papers Year : 2013

Robust Hash Algorithms for Text

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.

Domains

Computer Science [cs] Networking and Internet Architecture [cs.NI]
Fichier principal
Vignette du fichier
978-3-642-40779-6_11_Chapter.pdf (439.07 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01492815

Submitted on : Monday, March 20, 2017-3:51:17 PM

Last modification on : Wednesday, September 7, 2022-3:36:04 PM

Long-term archiving on : Wednesday, June 21, 2017-1:33:05 PM

Download

Dates and versions

hal-01492815 , version 1 (20-03-2017)

Licence

Attribution

Identifiers

Cite

Martin Steinebach, Peter Klöckner, Nils Reimers, Dominik Wienand, Patrick Wolf. Robust Hash Algorithms for Text. 14th International Conference on Communications and Multimedia Security (CMS), Sep 2013, Magdeburg,, Germany. pp.135-144, ⟨10.1007/978-3-642-40779-6_11⟩. ⟨hal-01492815⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC11 IFIP-TC6 IFIP-CMS IFIP-LNCS-8099
232 View
1342 Download

Altmetric

Share

More