Towards Provably Robust Watermarking
Watermarking techniques are used to help identify 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, i.e., 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.
KeywordsTuring Machine Watermark Scheme Probabilistic Program Marked Copy Watermark Protocol
Unable to display preview. Download preview PDF.
- 4.Barthe, G., Grégoire, B., Zanella Béguelin, S.: Formal certification of code-based cryptographic proofs. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 90–101. ACM (2009)Google Scholar
- 5.Barthe, G., Grégoire, B., Heraud, S., Zanella Béguelin, S.: Computer-Aided Security Proofs for the Working Cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 71–90. Springer, Heidelberg (2011)Google Scholar
- 7.Cox, I.J., Miller, M.L., Bloom, J.A.: Digital Watermarking. Morgan Kaufmann Publishers, Inc., San Francisco (2001)Google Scholar
- 8.Hasan, O., Tahar, S.: Probabilistic Analysis Using Theorem Proving. VDM Verlag (2008)Google Scholar
- 10.Hurd, J.: Formal Verification of Probabilistic Algorithms. PhD thesis, University of Cambridge (2002)Google Scholar
- 11.Katzenbeisser, S.: A computational model for digital watermarks. In: Workshop on Image Analysis for Multimedia Interactive Services (WIAMIS 2005) (2005)Google Scholar
- 12.Khanna, S., Zane, F.: Watermarking maps: hiding information in structured data. In: SODA, pp. 596–605 (2000)Google Scholar