A Watermarking Algorithm Based On Numerical Attributes In Relational Database

At present, Because of the rapid development of network and the raising level of information, there are more and more database applications, and the database copyright protection is also more pay attention. It is a new hotspot in the field of database security that how to protect the safety of the database for availability. The encryption and decryption of traditional systems can not be a good solution to copyright protection and issues such as data validation, but digital watermarking technology provide an effective solution to ideas and methods. In this paper, we concern about the characters of relational database and digital watermarking technology, based on studying existing relational database watermarking algorithm, propose a relational database watermarking algorithm based on the numerical properties , the main job there is:A scrambling transform Arnold algorithm is introduced, and the algorithm of digital watermark information can be used as the pretreatment process to improve the security of watermarking ; Because the typical algorithm for LSB replacement has the shortcomings of the existing weak anti-attack capability, the error control rough, easy to produce pathological results ,a new type of watermarking algorithm based on the numerical properties of the relational database are proposed. First we take the two-to geometric image scrambling to transform Arnold pre-treatment to improve watermark security, through a combination of certain characteristics in the physical storage of relational database primary key spaces, the watermarks are embed into the numeric data by changing their parity of the low order number, rather than a direct response to the physical storage of data-bit operation. The use of double screening mechanism determine the watermark embedded location to sure embedding watermark more safer and hidden, the process of embedding meets the requirement of the database for synchronous dynamic updating. The detection of watermarks need no original database, thus realizes the blind-detection.The experimental results show that this algorithm is better hidden and robustness when subjected to the normal database update and subjected to malicious attacks, the watermark can be extracted well.