Statistical Analysis of a Linear Algebra Asymmetricwatermarking Scheme

We introduce a novel asymmetric watermarking scheme, involving a private key for embedding and a public key for detection, and we detail its statistical analysis, relying on Neyman-Pearson criterion. The proposed scheme solves part of the problems connected to previous watermarking approaches based on linear algebra. In particular, special attention is paid at reducing the side information required at the detector, as well as at achieving higher robustness by enphasizing the contribution of the watermark in the detection phase.