摘要
提出一种能嵌入有意义水印信息并可由用户定义各种约束的水印算法CAMW(Constraints Allowa-ble Meaningful Watermark Algorithm),该算法将水印信息映射成二进制串,并把每个水印信息位重复嵌入多次,最后经选举过程确定出完整的水印,较大地提高了正确提取水印的概率.CAMW不仅使嵌入水印的数据能有效保持关系数据的语义特征,而且有很强的鲁棒性,仿真试验表明能有效抵御子集删除,子集添加,数据修改等多种攻击.
Watermarki data owner over database. ng relational database is a valuable technique, which proclaim the ownership of In this paper we propose an algorithm for watermarking CAMW(Constraints Allowable Meaningful Watermark Algorithm) which could insert meaningful watermark information and is possible for users to define kinds of constraint, and maintain the semantic character of the relational data. By experimentation, the algorithm prove to be very robust and could survive many attacks such as subset selection, subset addition, subset alteration and so on.
出处
《武汉大学学报(理学版)》
CAS
CSCD
北大核心
2005年第5期589-593,共5页
Journal of Wuhan University:Natural Science Edition
基金
国家863计划资助项目(2002AA4Z3450)
关键词
数字水印
关系数据库
版权保护
CAMW算法
选举过程
digital watermark
relational database
copyright protection
CAMW algorithm
voting process