{"id":2136,"date":"2012-08-19T08:25:48","date_gmt":"2012-08-19T08:25:48","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=2136"},"modified":"2013-03-08T05:48:13","modified_gmt":"2013-03-08T05:48:13","slug":"towards-provably-robust-watermarking","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/towards-provably-robust-watermarking\/","title":{"rendered":"Rese\u00f1a: Towards provably robust watermarking"},"content":{"rendered":"<p>El martes (14 de agosto de 2012) se present\u00f3 en el <a href=\"http:\/\/itp2012.cs.princeton.edu\">ITP 2012<\/a> (Interactive Theorem Proving) un trabajo de razonamiento formalizado en <a href=\"http:\/\/coq.inria.fr\">Coq<\/a> titulado <a href=\"http:\/\/hal.inria.fr\/docs\/00\/68\/23\/98\/PDF\/techreport.pdf\">Towards provably robust watermarking<\/a>.<\/p>\n<p>Sus autores son <a href=\"http:\/\/www.lix.polytechnique.fr\/~dbaelde\">David Baelde<\/a>, <a href=\"http:\/\/cedric.cnam.fr\/~courtiep\">Pierre Courtieu<\/a>, <a href=\"http:\/\/people.irisa.fr\/David.Gross_Amblard\">David Gross-Amblard<\/a> y<br \/>\n<a href=\"http:\/\/www.lri.fr\/~paulin\">Christine Paulin-Mohring<\/a>.<\/p>\n<p>El resumen del trabajo es<\/p>\n<blockquote><p>\n<a href=\"http:\/\/en.wikipedia.org\/wiki\/Digital_watermarking\">Watermarking techniques<\/a> 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 <a href=\"http:\/\/coq.inria.fr\">Coq<\/a>. We used the <a href=\"http:\/\/www.lri.fr\/~paulin\/ALEA\"><\/a>ALEA<\/a> 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.\n<\/p><\/blockquote>\n<p>El c\u00f3digo de la formalizaci\u00f3n en Coq se encuentra <a href=\"http:\/\/www.lix.polytechnique.fr\/~dbaelde\/watermarking\">aqu\u00ed<\/a>.<\/p>\n<p>El trabajo es parte del proyecto <a href=\"http:\/\/scalp.gforge.inria.fr\">SCALP<\/a> (Security of Cryptographic ALgorithms with Probabilities).<\/p>\n","protected":false},"excerpt":{"rendered":"<p>El martes (14 de agosto de 2012) se present\u00f3 en el ITP 2012 (Interactive Theorem Proving) un trabajo de razonamiento formalizado en Coq titulado Towards provably robust watermarking. Sus autores son David Baelde, Pierre Courtieu, David Gross-Amblard y Christine Paulin-Mohring. El resumen del trabajo es Watermarking techniques are used to help identifying copies of publicly&#8230;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[100],"tags":[45,89,285],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_likes_enabled":false,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/2136"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/comments?post=2136"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/2136\/revisions"}],"predecessor-version":[{"id":2792,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/2136\/revisions\/2792"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=2136"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=2136"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=2136"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}