Reliability criteria in information theory and in statistical hypothesis testing
Foundations and Trends in Communications and Information Theory
Random-coding lower bounds for the error exponent of joint quantization and watermarking systems
IEEE Transactions on Information Theory
IWDW'02 Proceedings of the 1st international conference on Digital watermarking
Informed embedding for multi-bit watermarks
IWDW'02 Proceedings of the 1st international conference on Digital watermarking
Lower bounds on the capacity of the relay channel with states at the source
EURASIP Journal on Wireless Communications and Networking
Cooperative relaying with state available noncausally at the relay
IEEE Transactions on Information Theory
On achievable regions of public multiple-access gaussian watermarking systems
IH'04 Proceedings of the 6th international conference on Information Hiding
Watermarking identification codes with related topics on common randomness
General Theory of Information Transfer and Combinatorics
| Hi-index | 754.96 |
Watermarking codes are analyzed from an information-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