{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:29:12Z","timestamp":1767983352519,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-024-02934-x","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:01:36Z","timestamp":1716379296000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Structured Watermarks for Structured Software"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3688-5838","authenticated-orcid":false,"given":"Lucila M. S.","family":"Bento","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davidson R.","family":"Boccardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael C. S.","family":"Machado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vin\u00edcius G.","family":"Pereira de S\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"2934_CR1","unstructured":"The Software Alliance: Software Management: Security Imperative, Business Opportunity. BSA Global Software Survey (2018). BSA Global Software Survey. https:\/\/www.bsa.org\/files\/2019-02\/2018_BSA_GSS_Report_en_.pdf"},{"key":"2934_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s13132-020-00653-1","author":"SA Asongu","year":"2020","unstructured":"Asongu SA. Global software piracy, technology and property rights institutions. J Knowl Econ. 2020. https:\/\/doi.org\/10.1007\/s13132-020-00653-1.","journal-title":"J Knowl Econ."},{"key":"2934_CR3","series-title":"Addison-Wesley software security series","volume-title":"Surreptitious software: obfuscation, watermarking, and tamperproofing for software protection","author":"C Collberg","year":"2009","unstructured":"Collberg C, Nagra J. Surreptitious software: obfuscation, watermarking, and tamperproofing for software protection. 1st ed. Addison-Wesley software security series. Addison-Wesley Professional; 2009.","edition":"1"},{"key":"2934_CR4","doi-asserted-by":"crossref","unstructured":"Hamilton J, Danicic S. A survey of static software watermarking. In: 2011 World Congress on Internet Security (WorldCIS-2011), 2011; pp. 100\u20137 IEEE","DOI":"10.1109\/WorldCIS17046.2011.5749891"},{"key":"2934_CR5","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, Sinha S. A graph theoretic approach to software watermarking. In: Moskowitz IS, editor. Information hiding. Berlin: Springer; 2001. p. 157\u201368."},{"key":"2934_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s41403-018-0058-8","volume":"4","author":"A Dey","year":"2019","unstructured":"Dey A, Bhattacharya S, Chaki N. Software watermarking: progress and challenges. INAE Lett. 2019;4:65\u201375.","journal-title":"INAE Lett"},{"key":"2934_CR7","doi-asserted-by":"publisher","unstructured":"Chroni M, Nikolopoulos SD. An embedding graph-based model for software watermarking. In: 2012 Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2012;pp. 261\u20134. https:\/\/doi.org\/10.1109\/IIH-MSP.2012.69","DOI":"10.1109\/IIH-MSP.2012.69"},{"key":"2934_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.dam.2018.04.021","volume":"250","author":"M Chroni","year":"2018","unstructured":"Chroni M, Nikolopoulos SD, Palios L. Encoding watermark numbers as reducible permutation graphs using self-inverting permutations. Discret Appl Math. 2018;250:145\u201364. https:\/\/doi.org\/10.1016\/j.dam.2018.04.021.","journal-title":"Discret Appl Math"},{"key":"2934_CR9","doi-asserted-by":"publisher","unstructured":"Mpanti A, Nikolopoulos SD, Rini M. Experimental study of the resilience of a graph-based watermarking system under edge modifications. In: Proceedings of the 21st Pan-Hellenic Conference on Informatics. PCI 2017. Association for Computing Machinery, New York, NY, USA 2017; https:\/\/doi.org\/10.1145\/3139367.3139436","DOI":"10.1145\/3139367.3139436"},{"key":"2934_CR10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.dam.2016.09.038","volume":"234","author":"LMS Bento","year":"2018","unstructured":"Bento LMS, Boccardo DR, Machado RCS, S\u00e1 VG, Szwarcfiter JL. On the resilience of canonical reducible permutation graphs. Discrete Appl Math. 2018;234:32\u201346. https:\/\/doi.org\/10.1016\/j.dam.2016.09.038. (Special Issue on the Ninth International Colloquium on Graphs and Optimization, 2014).","journal-title":"Discrete Appl Math."},{"issue":"2","key":"2934_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/JCS-210048","volume":"31","author":"A Mpanti","year":"2023","unstructured":"Mpanti A, Nikolopoulos SD, Palios L. Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks. J Comput Secur. 2023;31(2):107\u201328. https:\/\/doi.org\/10.3233\/JCS-210048.","journal-title":"J Comput Secur"},{"key":"2934_CR12","doi-asserted-by":"publisher","unstructured":"Bento LMS, Boccardo D, Machado RCS, S\u00e1 VG, Szwarcfiter JL. Towards a provably resilient scheme for graph-based watermarking. In: Brandst\u00e4dt A, Jansen K, Reischuk R (eds) Graph-Theoretic Concepts in Computer Science: 39th International Workshop, WG 2013, L\u00fcbeck, Germany, June 19\u201321, 2013, Revised Papers, 2013;pp. 50\u201363. Springer, New York, NY, USA. https:\/\/doi.org\/10.1007\/978-3-642-45043-3_6","DOI":"10.1007\/978-3-642-45043-3_6"},{"key":"2934_CR13","doi-asserted-by":"publisher","first-page":"2899","DOI":"10.1007\/s00453-019-00557-w","volume":"81","author":"LMS Bento","year":"2019","unstructured":"Bento LMS, Boccardo DR, Machado RCS, S\u00e1 VG, Szwarcfiter JL. Full characterization of a class of graphs tailored for software watermarking. Algorithmica. 2019;81:2899\u2013916. https:\/\/doi.org\/10.1007\/s00453-019-00557-w.","journal-title":"Algorithmica"},{"key":"2934_CR14","volume-title":"Structured programming","year":"1972","unstructured":"Dahl OJ, Dijkstra EW, Hoare CAR, editors. Structured programming. London: Academic Press Ltd.; 1972."},{"issue":"261","key":"2934_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2017.07.033","volume":"2019","author":"LMS Bento","year":"2016","unstructured":"Bento LMS, Boccardo DR, Machado RCS, Miyazawa FK, S\u00e1 VG, Szwarcfiter JL. Dijkstra graphs. Discrete Appl Math. 2016;2019(261):52\u201362. https:\/\/doi.org\/10.1016\/j.dam.2017.07.033. (GO X Meeting, Rigi Kaltbad (CH), July 10-14.).","journal-title":"Discrete Appl Math."},{"key":"2934_CR16","unstructured":"Davidson RI, Myhrvold N. Method and system for generating and auditing a signature for a computer program. Google Patents. US Patent 5,559,884 1996."},{"key":"2934_CR17","unstructured":"Arboit G. A method for watermarking java programs via opaque predicates. In: In Proc. International Conference on Electronic Commerce Research (ICECR-5) 2002."},{"key":"2934_CR18","doi-asserted-by":"publisher","unstructured":"Collberg C, Carter E, Debray S, Huntwork A, Kececioglu J, Linn C, Stepp M. Dynamic path-based software watermarking. In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation. PLDI 2004;\u201904: pp. 107\u201318. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/996841.996856","DOI":"10.1145\/996841.996856"},{"key":"2934_CR19","doi-asserted-by":"publisher","unstructured":"Cousot P, Cousot R. An abstract interpretation-based framework for software watermarking. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL 2004;\u201904: pp. 173\u201385. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/964001.964016","DOI":"10.1145\/964001.964016"},{"key":"2934_CR20","doi-asserted-by":"publisher","unstructured":"Monden A, Iida H, Matsumoto K, Torii K, Inoue K. A practical method for watermarking java programs. In: 24th International Computer Software and Applications Conference (COMPSAC 2000), 25\u201328 October 2000, Taipei, Taiwan, 2000;pp. 191\u20137. https:\/\/doi.org\/10.1109\/CMPSAC.2000.884716","DOI":"10.1109\/CMPSAC.2000.884716"},{"key":"2934_CR21","doi-asserted-by":"publisher","unstructured":"Nagra J, Thomborson CD. Threading software watermarks. In: Information Hiding, 6th International Workshop, IH 2004, Toronto, Canada, May 23\u201325, 2004, Revised Selected Papers, 2004;pp. 208\u201323. https:\/\/doi.org\/10.1007\/978-3-540-30114-1_15","DOI":"10.1007\/978-3-540-30114-1_15"},{"key":"2934_CR22","doi-asserted-by":"publisher","unstructured":"Qu G, Potkonjak M. Analysis of watermarking techniques for graph coloring problem. In: Proceedings of the 1998 IEEE\/ACM International Conference on Computer-aided Design. ICCAD 1998;\u201998: pp. 190\u20133. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/288548.288607","DOI":"10.1145\/288548.288607"},{"issue":"4","key":"2934_CR23","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.cose.2012.03.004","volume":"31","author":"Y Zeng","year":"2012","unstructured":"Zeng Y, Liu F, Luo X, Lian S. Abstract interpretation-based semantic framework for software birthmark. Comput Secur. 2012;31(4):377\u201390. https:\/\/doi.org\/10.1016\/j.cose.2012.03.004.","journal-title":"Comput Secur"},{"key":"2934_CR24","doi-asserted-by":"crossref","unstructured":"Jacob RM, K, P, P.P A. Application of visual cryptography scheme in software watermarking. In: 2020 4th International Conference on Trends in Electronics and Informatics (ICOEI)(48184), 2020;pp. 1044\u20138.","DOI":"10.1109\/ICOEI48184.2020.9142987"},{"issue":"10","key":"2934_CR25","doi-asserted-by":"publisher","first-page":"2740","DOI":"10.24996\/ijs.2020.61.10.30","volume":"61","author":"SH Mnkash","year":"2020","unstructured":"Mnkash SH, Abdulmunem ME. A review of software watermarking. Iraqi J Sci. 2020;61(10):2740\u201350. https:\/\/doi.org\/10.24996\/ijs.2020.61.10.30.","journal-title":"Iraqi J Sci"},{"key":"2934_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s11416-023-00489-8","author":"MD Preda","year":"2023","unstructured":"Preda MD, Ianni M. Exploiting number theory for dynamic software watermarking. J Comput Virol Hacking Tech. 2023. https:\/\/doi.org\/10.1007\/s11416-023-00489-8.","journal-title":"J Comput Virol Hacking Tech"},{"key":"2934_CR27","doi-asserted-by":"publisher","unstructured":"Kim T, Jang Y, Lee C, Koo H, Kim H. Smartmark: software watermarking scheme for smart contracts, 2023;pp. 283\u201394 https:\/\/doi.org\/10.1109\/ICSE48619.2023.00035 . Cited by: 0; All Open Access, Green Open Access. https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85171746334 &doi=10.1109","DOI":"10.1109\/ICSE48619.2023.00035"},{"key":"2934_CR28","doi-asserted-by":"publisher","unstructured":"Collberg C, Thomborson C. Software watermarking: models and dynamic embeddings. In: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL 1999;\u201999: pp. 311\u201324. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/292540.292569","DOI":"10.1145\/292540.292569"},{"key":"2934_CR29","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. Graph-based approaches to software watermarking. In: Bodlaender HL, editor. Graph-Theoretic Concepts in Computer Science. Berlin: Springer; 2003. p. 156\u201367."},{"key":"2934_CR30","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-39890-5_14","volume":"2880","author":"C Collberg","year":"2003","unstructured":"Collberg C, Kobourov S, Carter E, Thomborson C. Error-correcting graphs for software watermarking. Lect Notes Comput Sci. 2003;2880:156\u201367.","journal-title":"Lect Notes Comput Sci"},{"key":"2934_CR31","doi-asserted-by":"publisher","unstructured":"Mpanti A, Nikolopoulos SD, Rini M. Experimental study of the resilience of a graph-based watermarking system under edge modifications. In: Proceedings of the 21st Pan-Hellenic Conference on Informatics. PCI 2017. Association for Computing Machinery, New York, NY, USA 2017. https:\/\/doi.org\/10.1145\/3139367.3139436","DOI":"10.1145\/3139367.3139436"},{"key":"2934_CR32","volume-title":"Introduction to error-correcting codes","author":"M Purser","year":"1995","unstructured":"Purser M. Introduction to error-correcting codes. Artech House; 1995."},{"issue":"2","key":"2934_CR33","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed IS, Solomon G. Polynomial codes over certain finite fields. J Soc Ind Appl Math. 1960;8(2):300\u20134. https:\/\/doi.org\/10.1137\/0108018.","journal-title":"J Soc Ind Appl Math"},{"key":"2934_CR34","volume-title":"Metrics and models in software quality engineering","author":"SH Kan","year":"2002","unstructured":"Kan SH. Metrics and models in software quality engineering. 2nd ed. Delhi: Addison-Wesley Professional; 2002.","edition":"2"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-02934-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-02934-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-02934-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:12:01Z","timestamp":1716379921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-02934-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,22]]},"references-count":34,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["2934"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-02934-x","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,22]]},"assertion":[{"value":"24 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"568"}}