Key Length Estimation of Zero-Bit Watermarking Schemes - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Key Length Estimation of Zero-Bit Watermarking Schemes

Patrick Bas
Teddy Furon

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.
Fichier principal
Vignette du fichier
paper.pdf (578.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00728159 , version 1 (05-09-2012)

Identifiers

  • HAL Id : hal-00728159 , version 1

Cite

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⟩
407 View
97 Download

Share

Gmail Facebook X LinkedIn More