基于Asmuth-Bloom体系的动态图水印实现方案

摘要

针对动态图水印的鲁棒性及恢复率较低问题,提出基于Asmuth-Bloom体系的动态图水印算法,将密码学中的密钥共享思想引入到软件水印中,将水印信息w分成n份,备份之间没有包含关系,任何t(t≤n)份可以计算出w,而任何t-1份则不能,实现了基于部分内容提取水印.以弥补水印算法的缺陷,阻止攻击者通过透彻分析运行时堆栈获取原始水印.%Aiming at the robustness and low restoration ratio of dynamic map watermarking, a dynamic map watermarking algorithm based on Asmuth-Bloom system is praposed.The shared key of cryptology is introduced in software watermarking to divide watermarking information w into n parts, each part doesn't have any inclusion relationship, any can calculate w, but any t-1 can' t do that.This implementation of extracting watermarking based on parts content can supply a gap of watermarking algorithm, and prevent attackers from analyzing running stack to get the original watermarking.