{"title":"动态水印鲁棒性分析","authors":"I. Nechta","doi":"10.1109/SIBIRCON.2017.8109892","DOIUrl":null,"url":null,"abstract":"In this paper we propose new attack on dynamic watermark scheme Radix-n widely known as one of the most secure. It was shown that we are able to reveal dynamically allocated memory blocks and then a digital watermark can be discovered by hooking API function calls. During the experiment it was ascertained that often an amount of such structures is low because of widely used optimization. This feature increases a probability of successful attack on dynamic watermark.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Robustness analysis for dynamic watermarks\",\"authors\":\"I. Nechta\",\"doi\":\"10.1109/SIBIRCON.2017.8109892\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose new attack on dynamic watermark scheme Radix-n widely known as one of the most secure. It was shown that we are able to reveal dynamically allocated memory blocks and then a digital watermark can be discovered by hooking API function calls. During the experiment it was ascertained that often an amount of such structures is low because of widely used optimization. This feature increases a probability of successful attack on dynamic watermark.\",\"PeriodicalId\":135870,\"journal\":{\"name\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBIRCON.2017.8109892\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2017.8109892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we propose new attack on dynamic watermark scheme Radix-n widely known as one of the most secure. It was shown that we are able to reveal dynamically allocated memory blocks and then a digital watermark can be discovered by hooking API function calls. During the experiment it was ascertained that often an amount of such structures is low because of widely used optimization. This feature increases a probability of successful attack on dynamic watermark.