一种基于m序列的关系数据库鲁棒水印算法  

Robust Algorithm for Relational Database Watermarking Based on m Sequence

作　　者：朱勤[1] 刘良旭[2] 乐嘉锦[2] 

机构地区：[1]南通大学计算机科学与技术学院,江苏南通226019 [2]东华大学信息科学与技术学院,上海200051

出　　处：《小型微型计算机系统》2008年第8期1486-1490,共5页Journal of Chinese Computer Systems

基　　金：江苏省高校自然科学研究计划项目(05KJD520168)资助;上海市科委产学研项目(05DZ11C06)资助

摘　　要：提出一种关系数据库水印算法,适用于数值型数据的版权保护.以连接多项式数组为密钥生成m序列,分别作为水印信号和水印嵌入策略控制信号;根据密钥和元组主键连接值的散列运算确定水印嵌入位置;通过修改数值属性低位数值的奇偶性嵌入水印,克服了常用的最低有效位重置算法易产生病态结果的缺点.水印的嵌入满足数据库动态更新的同步要求,水印的检测无需原始数据库参与.理论分析和实验表明,该算法运算开销合理,具有良好的隐蔽性和安全性,对常见的水印攻击具有良好的鲁棒性.An algorithm for relational database watermarking is proposed in this paper, and it is applicable to protect the copyright of numeric data. The rn sequences are generated based on the secret key coming from a connection polynomial array, and are used for the watermark signal and the control signal for watermark embedding. The watermarking position is determined by the Hash operation of the bit catenation of the secret key and the primary key. The watermark is embedded into the numeric data by changing the parity of their low order numbers, thus avoids the syndrome phenomena caused by the usual Least Significant Bit （LSB） watermarking algorithm. The embedment of the watermark meets the requirement of the synchronous dynamic updating for the database, and the detection of the watermark needs only the secret key. Both the theoretical analysis and the practical experiments prove that this algorithm possesses fine efficiency, imperceptibility and security, and it is robust to common attacks towards the watermark.

关 键 词：关系数据库 数据库水印 鲁棒性 M序列 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]