Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (7): 179-181.

• 数据库与信息处理 • Previous Articles     Next Articles

A watermarking algorithm of database based on expanded Asmuth-bloom scheme

  

  • Received:2006-06-26 Revised:1900-01-01 Online:2007-03-01 Published:2007-03-01

基于扩展的Asmuth-Bloom体系的数据库水印算法

彭沛夫 张桂芳 胡斌   

  1. 湖南师范大学物理与信息科学学院 湖南大学计算机与通信学院 华中科技大学管理学院
  • 通讯作者: 彭沛夫

Abstract: Asmuth-bloom scheme is a sharing secret algorithm based on Chinese remainder theorem. Using Asmuth-bloom scheme in a database watermark can make the algorithm have a good effect of hiding and resisting subset attack. But, sharing watermark expands the watermark date and reduces the information capacity of the database. By expanding Asmuth-bloom scheme and adjusting the parameters’ value, the author finds that this algorithm has a good effect of security and resisting subset attack, embedded information increased, and the performance improved much. In protecting the copyright of database, this algorithm has good application.

摘要: Asmuth-Bloom体系是一种基于中国剩余定理的密钥分存门限方案。将Asmuth-Bloom体系思想应用于数据库水印算法,可以使水印具有好的安全性和抗子集攻击能力。但是,该算法对水印信息的分存处理,扩张了水印数据,相对减少了数据库可容纳水印信息量。作者通过研究发现,将Asmuth-Bloom体系思想加以扩展,调整参数取值,不仅使水印具有很好的安全性和抗子集攻击能力,能够基于部分数据恢复水印信息,而且水印数据扩张大量减少,可嵌入的水印信息量大量增加,算法性能进一步提高。在数据库的版权保护中,该算法具有很好的应用价值。