{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:47:07Z","timestamp":1725756427134},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_6","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T09:05:50Z","timestamp":1384247150000},"page":"50-63","source":"Crossref","is-referenced-by-count":2,"title":["Towards a Provably Resilient Scheme for Graph-Based Watermarking"],"prefix":"10.1007","author":[{"given":"Lucila Maria Souza","family":"Bento","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davidson","family":"Boccardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael Carlos Santos","family":"Machado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vin\u00edcius Gusm\u00e3o","family":"Pereira de S\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme Luiz","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: Efficient encoding of watermark numbers as reducible permutation graphs. arXiv:1110.1194v1 [cs.DS] (2011)","DOI":"10.1145\/2383276.2383295"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: Encoding watermark numbers as cographs using self-inverting permutations. In: 12th Int\u2019l Conference on Computer Systems and Technologies, CompSysTech 2011, vol.\u00a0578, pp. 142\u2013148. ACM ICPS (2011) (Best Paper Award)","DOI":"10.1145\/2023607.2023632"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: An efficient graph codec system for software watermarking. In: 36th IEEE Conference on Computers, Software, and Applications (COMPSAC 2012). IEEE Proceedings, pp. 595\u2013600 (2012)","DOI":"10.1109\/COMPSACW.2012.116"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: Multiple encoding of a watermark number into reducible permutation graphs using cotrees. In: 13th Int\u2019l Conference on Computer Systems and Technologies (CompSysTech 2012). ACM ICPS Proceedings, pp. 118\u2013125 (2012)","DOI":"10.1145\/2383276.2383295"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chroni, M., Nikolopoulos, S.D.: An embedding graph-based model for software watermarking. In: 8th Int\u2019l Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2012. IEEE Proceedings, pp. 261\u2013264 (2012)","DOI":"10.1109\/IIH-MSP.2012.69"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.infsof.2008.09.016","volume":"51","author":"C. Collberg","year":"2009","unstructured":"Collberg, C., Huntwork, A., Carter, E., Townsend, G., Stepp, M.: More on graph theoretic software watermarks: implementation, analysis and attacks. Information and Software Technology\u00a051, 56\u201367 (2009)","journal-title":"Information and Software Technology"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-39890-5_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C. Collberg","year":"2003","unstructured":"Collberg, C., Kobourov, S., Carter, E., Thomborson, C.: Error-correcting graphs for software watermarking. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 156\u2013167. Springer, Heidelberg (2003)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Collberg, C., Thomborson, C.: Software watermarking models and dynamic embeddings. In: Proc. 26th ACM SIGPLAN-SIGACT on Principles of Programming Languages, POPL 1999, pp. 311\u2013324 (1999)","DOI":"10.1145\/292540.292569"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1286821.1286826","volume":"29","author":"C. Collberg","year":"2007","unstructured":"Collberg, C., Thomborson, C., Townsend, G.M.: Dynamic graph-based software fingerprinting. ACM Transactions on Programming Languages and Systems\u00a029, 1\u201367 (2007)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR10","unstructured":"Davidson, R.L., Myhrvold, N.: Method and system for generating and auditing a signature for a computer program, US Patent 5.559.884. Microsoft Corporation (1996)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0201014","volume":"1","author":"M.S. Hecht","year":"1972","unstructured":"Hecht, M.S., Ullman, J.D.: Flow graph reducibility. SIAM J. Computing\u00a01, 188\u2013202 (1972)","journal-title":"SIAM J. Computing"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/321832.321835","volume":"21","author":"M.S. Hecht","year":"1974","unstructured":"Hecht, M.S., Ullman, J.D.: Characterizations of reducible flow graphs. Journal of the ACM\u00a021, 367\u2013375 (1974)","journal-title":"Journal of the ACM"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Zhu, J., Liu, Y., Yin, K.: A novel dynamic graph software watermark scheme. In: 1st Int\u2019l Workshop on Education Technology and Computer Science, vol.\u00a03, pp. 775\u2013780 (2009)","DOI":"10.1109\/ETCS.2009.709"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45496-9_12","volume-title":"Information Hiding","author":"R. Venkatesan","year":"2001","unstructured":"Venkatesan, R., Vazirani, V.V., Sinha, S.: A graph theoretic approach to software watermarking. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol.\u00a02137, pp. 157\u2013168. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T16:03:24Z","timestamp":1596816204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}