TY - CHAP
T1 - Natural language watermarking and tamperproofing
AU - Atallah, Mikhail J.
AU - Raskin, Victor
AU - Hempelmann, Christian F.
AU - Karahan, Mercan
AU - Sion, Radu
AU - Topkara, Umut
AU - Triezenberg, Katrina E.
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/35248834521
U2 - 10.1007/3-540-36415-3_13
DO - 10.1007/3-540-36415-3_13
M3 - Chapter
AN - SCOPUS:35248834521
SN - 3540004211
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 196
EP - 212
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Petitcolas, Fabien A. P.
PB - Springer Verlag
ER -