An Algorithm Resistive to Invertibility Attack in Watermarking Relational Databases
As a copyright protection technique, digital watermarking has arisen more and more attention from the public. It has been widely applied to copyright protection of multimedia data (images, video and audio). The increasing use of relational databases also calls for the need of applying the technique to databases in order to protect the copyright. With the development of digital watermarking technique for relational databases, some studies go deep into watermarking attacks. Study on attacks will obtain algorithm抯 improvement and technique抯 development. Although there are several relational database digital watermarking algorithms, they cannot resist some attacks like invertibility attack. Invertibility attack is such an attack that the attacker.nds a.ctitious watermark in the watermarked database, and he fabricates an original database to announce his copyright possession. Thus it will result in the confusion of copyright con.rmation. After analyzing the invertibility attack and studying the current watermarking algorithms on relational databases, we propose an algorithm by constructing relating characteristics according to the content of the database, which can resist invertibility attack ef.ciently. The simulative experiments also demonstrate that the algorithm is resistive to subset attacks as well.
Digital Watermarking Relational Databases Invertibility Attack Relating Characteristic Robust
Xiaomei Dong Xiaohua Li Ge Yu Lei Zheng
School of Information Science and Engineering, Northeastern University, Shenyang 110004
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
1532-1537
2009-06-17（万方平台首次上网日期，不代表论文的发表时间）