{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:44:27Z","timestamp":1725522267881},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922377"},{"type":"electronic","value":"9783540922384"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92238-4_31","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T06:04:33Z","timestamp":1229407473000},"page":"395-409","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of Obtaining Optimal Watermarking Schemes"],"prefix":"10.1007","author":[{"given":"Julien","family":"Lafaye","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (2007)"},{"issue":"10","key":"31_CR2","doi-asserted-by":"publisher","first-page":"3976","DOI":"10.1109\/TSP.2005.855418","volume":"53","author":"F. Cayre","year":"2005","unstructured":"Cayre, F., Fontaine, C., Furon, T.: Watermarking security: Theory and practice. IEEE Transactions on Signal Processing\u00a053(10), 3976\u20133987 (2005)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"31_CR3","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1109\/18.923725","volume":"47","author":"B. Chen","year":"2001","unstructured":"Chen, B., Wornell, G.W.: Quantization index modulation: A class of provably good methods for digital watermarking and information embedding. IEEE Transactions on Information Theory\u00a047(4), 1423\u20131443 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TSP.2005.861894","volume":"54","author":"P. Comesa\u00f1a","year":"2006","unstructured":"Comesa\u00f1a, P., P\u00e9rez-Gonz\u00e1lez, F., Balado, F.: Watermarking security: a survey. IEEE Transactions on Signal Processing\u00a054(2), 585\u2013600 (2006)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"31_CR5","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":"31_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Apr. 1979. W.H. Freeman & Company, New York (1979)"},{"issue":"5","key":"31_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/MSP.2002.1028346","volume":"19","author":"C. Herley","year":"2002","unstructured":"Herley, C.: Why watermarking is nonsense. IEEE Signal Processing Magazine\u00a019(5), 10\u201311 (2002)","journal-title":"IEEE Signal Processing Magazine"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Kalker, T.: Considerations on watermarking security. In: Proceedings of the IEEE Multimedia Signal Processing Workshop, IIHMSP 2006, pp. 201\u2013206 (2001)","DOI":"10.1109\/MMSP.2001.962734"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Katzenbeisser, S., Petitcolas, F.A.: Information hiding, techniques for steganography and digital watermarking. Artech house (2000)","DOI":"10.1201\/1079\/43263.28.6.20001201\/30373.5"},{"key":"31_CR10","first-page":"5","volume":"IX","author":"A. Kerckhoffs","year":"1883","unstructured":"Kerckhoffs, A.: La cryptographie militaire. Journal des sciences militaires\u00a0IX, 5\u201338 (January 1883)","journal-title":"Journal des sciences militaires"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-36415-3_8","volume-title":"Information Hiding","author":"Q. Li","year":"2003","unstructured":"Li, Q., Chang, E.: Security of public watermarking schemes for binary sequences. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol.\u00a02578, pp. 119\u2013128. Springer, Heidelberg (2003)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Merhav, N., Sabbag, E.: Optimal watermark embedding and detection strategies under limited detection resources. In: IEEE Transactions on Information Theory (submitted) (December 2005), http:\/\/www.ee.technion.ac.il\/people\/merhav\/","DOI":"10.1109\/ISIT.2006.261759"},{"issue":"12","key":"31_CR13","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1109\/JPROC.2005.859599","volume":"93","author":"P. Moulin","year":"2005","unstructured":"Moulin, P., Koetter, R.: Data-hiding codes (tutorial paper). Proceedings of the IEEE\u00a093(12), 2083\u20132127 (2005)","journal-title":"Proceedings of the IEEE"},{"issue":"3","key":"31_CR14","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/TIT.2002.808134","volume":"49","author":"P. Moulin","year":"2003","unstructured":"Moulin, P., O\u2019Sullivan, J.A.: Information-theoretic analysis of information hiding. IEEE Transactions on Information Theory\u00a049(3), 563\u2013593 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"key":"31_CR15","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1993)"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","volume":"71","author":"C.H. Papadimitriou","year":"1986","unstructured":"Papadimitriou, C.H., Yannakakis, M.: A note on succinct representations of graphs. Information and Control\u00a071, 181\u2013185 (1986)","journal-title":"Information and Control"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: IEEE Symposium on Foundations of Computer Science, FOCS 2000, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"issue":"2","key":"31_CR18","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1145\/3149.3158","volume":"32","author":"S. Skyum","year":"1985","unstructured":"Skyum, S., Valiant, L.: A complexity theory based on boolean algebra. Journal of the ACM\u00a032(2), 484\u2013502 (1985)","journal-title":"Journal of the ACM"},{"key":"31_CR19","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1991","unstructured":"Wegener, I.: The Complexity of Boolean Functions, January 1991. Wiley, Chichester (1991)"}],"container-title":["Lecture Notes in Computer Science","Digital Watermarking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92238-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T05:23:20Z","timestamp":1557984200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92238-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922377","9783540922384"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92238-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}