Skip to Main content Skip to Navigation
Conference papers

Formal Proofs of Robustness for Watermarking Algorithms

Abstract : This paper presents the main ideas of the proof of a watermarking algorithm in the Coq proof assistant and the ALEA library on probabilities and probabilistic programs.
Complete list of metadata
Contributor : Laboratoire CEDRIC Connect in order to contact the contributor
Submitted on : Friday, March 6, 2015 - 11:37:45 AM
Last modification on : Saturday, August 6, 2022 - 3:46:30 AM


  • HAL Id : hal-01126043, version 1


Pierre Courtieu, David Baelde, Christine Paulin-Mohring, Xavier Urbain, David Gross-Amblard. Formal Proofs of Robustness for Watermarking Algorithms. TYPES WOKSHOP 2011, Sep 2011, X, France. ⟨hal-01126043⟩



Record views