GameTheoretic Analysis of Watermark Detection.pdfVIP

GAME-THEORETIC ANALYSIS OF WATERMARK DETECTION Pierre Moulin and Aleksandar Ivanovi´c Univ. of Illinois, Beckman Inst. ECE Dept., 405 N. Mathews Ave., Urbana, IL 61801 E-mail: moulin@ ABSTRACT mine whether the watermark was embedded in x or not. This paper describes a game-theoretic methodology to Hence the watermark detector’s task is solve a binary design and embed watermarks in images. The opti- hypothesis problem. See Fig. 1. There x = (s, m, k), mality criterion is probability of error of the decoder. where m ∈ {0, 1}. The embedding function satis- Analytical solutions are presented for problems involv- fies (s, 0, k) = s, i.e., it reproduces the original image ing Gaussian host images and illustrated with exam- when no watermark is embedded (m = 0). The de- ples. Significant improvements over previous designs tector’s output is mˆ = mˆ (y, k) ∈ {0, 1}. The key k is are obtained. modeled as random and independent of s. Host Composite 1. INTRODUCTION signal S Ψ(S,M,K) signal X Attack Y Decoder M channel A(y|x) Watermarking refers to the nearly invisible embedding Message M ε {0,1} of a message (watermark) within a host data set such Key K as t