The capacity of the vector Gaussian watermarking game

We compute the coding capacity of the watermarking game for a vector Gaussian covertext and squared-error distortions. As with a scalar Gaussian covertext Cohen and Lapidoth), the capacity does not depend on knowledge of the covertext at the decoder. Unlike the scalar version, an attacker based on the rate distortion solution (i.e. optimal compression) is suboptimal