{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:54:45Z","timestamp":1725900885086},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642323461"},{"type":"electronic","value":"9783642323478"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32347-8_14","type":"book-chapter","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T11:33:54Z","timestamp":1344598434000},"page":"201-216","source":"Crossref","is-referenced-by-count":1,"title":["Towards Provably Robust Watermarking"],"prefix":"10.1007","author":[{"given":"David","family":"Baelde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Courtieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Gross-Amblard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Paulin-Mohring","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-74124-4_10","volume-title":"Information Hiding","author":"A. Adelsbach","year":"2007","unstructured":"Adelsbach, A., Katzenbeisser, S., Sadeghi, A.-R.: A Computational Model for Watermark Robustness. In: Camenisch, J.L., Collberg, C.S., Johnson, N.F., Sallee, P. (eds.) IH 2006. LNCS, vol.\u00a04437, pp. 145\u2013160. Springer, Heidelberg (2007)"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00778-003-0097-x","volume":"12","author":"R. Agrawal","year":"2003","unstructured":"Agrawal, R., Haas, P.J., Kiernan, J.: Watermarking Relational Data: Framework, Algorithms and Analysis. VLDB J.\u00a012(2), 157\u2013169 (2003)","journal-title":"VLDB J."},{"issue":"8","key":"14_CR3","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.scico.2007.09.002","volume":"74","author":"P. Audebaud","year":"2009","unstructured":"Audebaud, P., Paulin-Mohring, C.: Proofs of randomized algorithms in COQ. MPC 2006\u00a074(8), 568\u2013589 (2009); A preliminary version appeared in the Proc. of MPC 2006","journal-title":"Science of Computer Programming"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Barthe, G., Gr\u00e9goire, B., Zanella B\u00e9guelin, S.: Formal certification of code-based cryptographic proofs. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 90\u2013101. ACM (2009)","DOI":"10.1145\/1594834.1480894"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-642-22792-9_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G. Barthe","year":"2011","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., Zanella B\u00e9guelin, S.: Computer-Aided Security Proofs for the Working Cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 71\u201390. Springer, Heidelberg (2011)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-25379-9_14","volume-title":"Certified Programs and Proofs","author":"T. Braibant","year":"2011","unstructured":"Braibant, T., Pous, D.: Tactics for Reasoning Modulo AC in COQ. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol.\u00a07086, pp. 167\u2013182. Springer, Heidelberg (2011)"},{"key":"14_CR7","volume-title":"Digital Watermarking","author":"I.J. Cox","year":"2001","unstructured":"Cox, I.J., Miller, M.L., Bloom, J.A.: Digital Watermarking. Morgan Kaufmann Publishers, Inc., San Francisco (2001)"},{"key":"14_CR8","unstructured":"Hasan, O., Tahar, S.: Probabilistic Analysis Using Theorem Proving. VDM Verlag (2008)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-70936-7_20","volume-title":"Theory of Cryptography","author":"N.J. Hopper","year":"2007","unstructured":"Hopper, N.J., Molnar, D., Wagner, D.: From Weak to Strong Watermarking. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 362\u2013382. Springer, Heidelberg (2007)"},{"key":"14_CR10","unstructured":"Hurd, J.: Formal Verification of Probabilistic Algorithms. PhD thesis, University of Cambridge (2002)"},{"key":"14_CR11","unstructured":"Katzenbeisser, S.: A computational model for digital watermarks. In: Workshop on Image Analysis for Multimedia Interactive Services (WIAMIS 2005) (2005)"},{"key":"14_CR12","unstructured":"Khanna, S., Zane, F.: Watermarking maps: hiding information in structured data. In: SODA, pp. 596\u2013605 (2000)"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32347-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:01:03Z","timestamp":1620129663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32347-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642323461","9783642323478"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32347-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}