Key Length Estimation of Zero-Bit Watermarking Schemes

Patrick Bas 1 Teddy Furon 2
LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
2 TEXMEX - Multimedia content-based indexing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : This paper proposes a new definition of Watermarking Security which is more in line with the cryptographic viewpoint. To this end, we derive the effective key length of a watermarking system from the probability of guessing a key equivalent to the original key. The effective key length is then computed for two zero-bit watermarking schemes based on normalized correlation by estimating the region of equivalent keys. We show that the security of these schemes is related to the distribution of the watermarked contents inside the detection region and is not antagonist with robustness. We conclude the paper by showing that the key length of the system used for the BOWS-2 international contest was indeed equal to 128 bits.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Patrick Bas <>
Submitted on : Wednesday, September 5, 2012 - 7:39:24 AM
Last modification on : Thursday, February 21, 2019 - 10:34:10 AM
Long-term archiving on : Friday, December 16, 2016 - 9:42:48 AM


Files produced by the author(s)


  • HAL Id : hal-00728159, version 1


Patrick Bas, Teddy Furon. Key Length Estimation of Zero-Bit Watermarking Schemes. EUSIPCO - 20th European Signal Processing Conference, Aug 2012, Romania. pp.TBA. ⟨hal-00728159⟩



Record views


Files downloads