Two main results in the area of information hiding in natural language text are presented. A semantically-based scheme dramatically improves the information-hiding capacity of any text through two techniques: (i) modifying the granularity of meaning of individual sentences, whereas our own previous scheme kept the granularity fixed, and (ii) halving the number of sentences affected by the watermark. No longer a "long text, short watermark" approach, it now makes it possible to watermark short texts, like wire agency reports. Using both the abovementioned semantic marking scheme and our previous syntactically-based method hides information in a way that reveals any non-trivial tampering with the text (while re-formatting is not considered to be tampering - the problem would be solved trivially otherwise by hiding a hash of the text) with a probability 1-2-β(n+1), n being its number of sentences and β a small positive integer based on the extent of co-referencing. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Atallah, M. J., Raskin, V., Hempelmann, C. F., Karahan, M., Sion, R., Topkara, U., & Triezenberg, K. E. (2003). Natural language watermarking and tamperproofing. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2578, 196–212. https://doi.org/10.1007/3-540-36415-3_13
Mendeley helps you to discover research relevant for your work.