Formal Proofs of Robustness for Watermarking Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

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.
No file

Dates and versions

hal-01126043 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01126043 , version 1

Cite

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⟩
38 View
0 Download

Share

Gmail Facebook X LinkedIn More