English version

PPS UMR 7126 – Laboratoire
Preuves, Programmes et Systèmes

Accueil · Présentation · Membres · Publications · Séminaire · Groupes de travail · Projets · πr²

David Baelde (Copenhagen)

Formal Proofs of Robustness for Watermarking Algorithms

I will present some new results on the security of watermarking schemes against arbitrary attackers, and their full formalization in Coq. This is joint work with P. Courtieu, D. Gross-Amblard and C. Paulin, as part of the ANR project Scalp which focuses on formal proofs of probabilistic algorithms.

Watermarking techniques are used to help identifying copies of publicly released information. They consist in applying a slight and secret modification to the data before its release, in a way that should be robust, ie., remain recognizable even in (reasonably) modified copies of the data.

We present new results about the robustness of watermarking schemes against arbitrary attackers, and the formalization of those results in Coq. We used the ALEA library, which formalizes probability theory and models probabilistic programs using a simple monadic translation. This work illustrates the strengths and particularities of the induced style of reasoning about probabilistic programs. Our technique for proving robustness is adapted from methods commonly used for cryptographic protocols, and we discuss its relevance to the field of watermarking.