Towards Provably Robust Watermarking

David Baelde 1, 2 Pierre Courtieu 3 David Gross-Amblard 4 Christine Paulin-Mohring 1, 2
2 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
4 LIS - Logical Information Systems
IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : 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. In this paper, 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.
Type de document :
Pré-publication, Document de travail
2012
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00682398
Contributeur : David Baelde <>
Soumis le : dimanche 25 mars 2012 - 21:34:13
Dernière modification le : mercredi 2 août 2017 - 10:06:41
Document(s) archivé(s) le : lundi 26 novembre 2012 - 12:05:51

Fichier

techreport.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00682398, version 1

Citation

David Baelde, Pierre Courtieu, David Gross-Amblard, Christine Paulin-Mohring. Towards Provably Robust Watermarking. 2012. 〈hal-00682398〉

Partager

Métriques

Consultations de la notice

737

Téléchargements de fichiers

251