Abstract
Watermarking (WM) systems are analyzed in the context of a game between an information hider, a decoder and an attacker. The value of the game is the maximin exponent of the probability of erroneously decoding the hidden message. A single-letter expression of the maximin error exponent and asymptotically optimal strategies are found under some mild assumptions.
| Original language | English |
|---|---|
| Pages (from-to) | 7 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2001 |
| Externally published | Yes |
| Event | 2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States Duration: 24 Jun 2001 → 29 Jun 2001 |