Open Access
On Random Coding Error Exponents of
Watermarking Systems
- 01 Jan 2000
TL;DR: This work provides a single-letter characterization of the maximin game of the random coding error exponent associated with the average probability of erroneously decoding the watermark in the case where the covertext source is memoryless.
read more
Abstract: Watermarking codes are analyzed from an infor- mation-theoretic viewpoint as a game between an information hider and an active attacker. While the information hider embeds a secret message (watermark) in a covertext message (typically: text, image, sound, or video stream) within a certain distortion level, the attacker processes the resulting watermarked message, within limited additional distortion, in attempt to invalidate the watermark. For the case where the covertext source is memoryless (or, more generally, where there exists some transformation that makes it memoryless), we provide a single-letter characterization of the maximin game of the random coding error exponent associated with the average probability of erroneously decoding the watermark. This single-letter characterization is in effect because if the information hider utilizes a memoryless channel to generate random codewords for every covertext message, the (causal) attacker will maximize the damage by implementing a memoryless channel as well. Partial results for the dual minimax game and the conditions for the existence of a saddle point are also presented.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
•Book
Information Theory: Coding Theorems for Discrete Memoryless Systems
I. Csiszar,János Körner +1 more
- 26 Sep 2014
TL;DR: This new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics.
4.2K
On the limits of steganography
TL;DR: It is shown that public key information hiding systems exist, and are not necessarily constrained to the case where the warden is passive, and the use of parity checks to amplify covertness and provide public key steganography.
Stretching the Limits of Steganography
Ross Anderson
- 30 May 1996
TL;DR: It was widely believed that public key steganography was impossible; it is shown how to do it and a number of possible approaches to the theoretical security of hidden communications are looked at.
Universal decoding for finite-state channels
TL;DR: In this article, a universal decoding procedure for finite-state channels is proposed, which achieves an error probability with an error exponent that, for large enough block length, is equal to the random coding error exponent associated with the optimal maximum likelihood decoding procedure.
152