期刊文献+

一种基于m序列的关系数据库鲁棒水印算法 被引量:1

Robust Algorithm for Relational Database Watermarking Based on m Sequence
在线阅读 下载PDF
导出
摘要 提出一种关系数据库水印算法,适用于数值型数据的版权保护.以连接多项式数组为密钥生成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.
出处 《小型微型计算机系统》 CSCD 北大核心 2008年第8期1486-1490,共5页 Journal of Chinese Computer Systems
基金 江苏省高校自然科学研究计划项目(05KJD520168)资助 上海市科委产学研项目(05DZ11C06)资助
关键词 关系数据库 数据库水印 鲁棒性 M序列 relational database database watermarking robustness m sequence
  • 相关文献

参考文献2

二级参考文献14

  • 1萨师煊 王珊.数据库系统概论[M].北京:高等教育出版社,1990..
  • 2沈允善.扩谱技术[M].北京:国防工业出版社,1995..
  • 3[6]B Schneier. Applied Cryptography [ M]. USA: John Wiley & Sons, Inc.1996.
  • 4[7]Radu Sion, Mikhail Atallah, Sunil Prabhakar. On watermarking numeric sets [ A]. Proceedings of the Workshop on Digital Watermarking [ C ].USA: IWDW. 2002.
  • 5[1]Stefan Katzenbeisse, Fabien A P Petitcolas. Information Hiding Techniques for Steganography and Digital Watermarking [ M ]. Boston, London: Artech House, 1999.
  • 6[3]Rakesh Agrawal, Jerry Kiernan. Watermarking Relational Databases[A]. Proceeding of the 28th VLDB Conference [ C]. Hongkong, China:28 VLDB, 2002.
  • 7[4]Radu Sion, Mikhail Atallah, Sunil Prabhakar. Rights protection for relational data [ A ]. Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data San Diego [ C ]. California: ACM SIGMOD,2003.98- 109.
  • 8[5]M Atallah, S Wagstaff. Watermarking with quadratic residues [ A ].Proc. of IS&T/SPIE Conference on Security and Watermarking of Multimedia Contents [ C]. USA:SPIE, January 1999.
  • 9McWilliams, F.J., Sloane, N.J.A. Pseudo-Random sequences and arrays. Proceedings of the IEEE, 1976,64(12):1715~1729.
  • 10Bartolini, F., Barni, M., Cappellini, V., et al. Mask building for perceptually hiding frequency embedded watermarks. In: Zhang, Y. Q., ed. Proceedings of the International Conference on Image Processing, Vol1. Chicago, 1998. 450~454.

共引文献84

同被引文献6

  • 1俞银燕,汤帜.数字版权保护技术研究综述[J].计算机学报,2005,28(12):1957-1968. 被引量:142
  • 2朱勤,于守健,乐嘉锦,骆轶姝.外包数据库系统安全机制研究[J].计算机科学,2007,34(2):152-156. 被引量:17
  • 3Hacigumus H, Iyer B, Mehrotra S. Providing Database as a Serviee[C]//ICDE 2002. San Jose,California,USA,2002.
  • 4Rosenblatt W, Trippe W, Mooney S. Digital Rights Manage ment: Business and Teehnology[M]. New York: M &T Books, 2002.
  • 5Garnett N. Digital Right ' s Management, Copyright, and Napster[J].ACM SIGecom Exchanges, 2001,2(2):1-5.
  • 6Epass 1 000 ND [EB/OL]. [2007-12-02]. http : / / www. ftsafe. com. cn/products/viewproduct.php? p= epasslknd, 2008.

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部