| 基于Asmuth-Bloom门限方案的动态图软件水印保护技术 |
| |
| 引用本文： | 汤春霞,程建华,王飞鹏,朱江涛.基于Asmuth-Bloom门限方案的动态图软件水印保护技术[J].计算机与现代化,2009(2). |
| |
| 作者姓名： | 汤春霞 程建华 王飞鹏 朱江涛 |
| |
| 作者单位： | 九江学院信息科学与技术学院,江西,九江,332005 |
| |
| 摘 要： | 动态图软件水印在抗攻击性方面较通常的静态水印有明显的优势,然而通过透彻的分析和修改嵌入水印后的程序,攻击者仍然可以找到水印结构并对其进行恶意破坏,从而使水印提取过程失败.为此,本文提出一种基于Asmuth-Bloom门限方案的软件水印分存算法,该算法将密码学中的密钥共享思想引入到软件水印中,实现了基于部分内容提取水印;最后通过鲁棒性对此算法进行了评测.该算法具有较强的鲁棒性,但该算法的不足之处是将水印数据扩张,减小了数据率和隐蔽性.
|
| 关 键 词： | 动态图软件水印 鲁棒性 防篡改 |
Protection of Dynamic Graph Watermark Based on Multiple Constants Encoding |
| |
| TANG Chun-xia,CHENG Jian-hua,WANG Fei-peng,ZHU Jiang-tao.Protection of Dynamic Graph Watermark Based on Multiple Constants Encoding[J].Computer and Modernization,2009(2). |
| |
| Authors: | TANG Chun-xia CHENG Jian-hua WANG Fei-peng ZHU Jiang-tao |
| |
| Affiliation: | School of Information Science and Technology;Jiujiang University;Jiujiang 332005;China |
| |
| Abstract: | In comparison with general static watermark,dynamic graph software watermark shows great superiority in terms of anti-attack.Therefore hackers can find the structure of the watermark and destruct the watermark through completely analyzing the watermarked program and bring a failure to the retrieval process.This paper presents an idea of protecting dynamic graph software watermark based on Asmuth-Bloom system.In this algorithm,the idea of the secret sharing to the software watermarking is introduced,which di... |
| |
| Keywords: | dynamic graph watermark robustness tamper proofing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
