Research Of Relational Database Watermarking Algorithm

In this paper, the concept and the elements of the digital watermarking technology, and the concept and the elements of the watermarking technology based on relational database are introduced . Also, several relational database watermarking algorithms are discussed .This paper proposes a relational database watermarking algorithm based on cyclic redundancy check.We embed the digital watermarking ,which has been encrypted and added cyclic redundancy check code , into the database , after ordering the tuples clandestinely, controlling the proportion and error , and grouping the tuples . When we extract and detect the digital watermarking from the database , we should calculate the hash value ,proportion , error , and the information of grouping the database firstly .And then, we extract the least significant bit from the selected attributes .After most of election , we use the cyclic redundancy check to verdict whether the database has been attacked or tampered .If not , we decrypt the extracted watermarking information .The experiment shows that the relational database watermarking algorithm based on cyclic redundancy check has the following characteristics: high security, high data availability, blind watermarking, and the ability of detecting tamper.