System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Second-LSB-Dependent Robust Watermarking for Relational Database

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiangrong Xiao ; Hunan Univ., Changsha ; Xingming Sun ; Minggang Chen

A novel robust watermarking algorithm based on the second-LSB (least significant bit) is proposed. The algorithm first groups the data by the hash value of the primary key and positions with the second-LSB of the data in every group. The watermark is not directly embedded in one single item, but one bit is embedded into one group by setting a pseudo-random number to the LSB of the data. A threshold, which is used for detection to be compared with the occurrence frequency of LSB positioned in embedding, and set according to the distribution probabilities of the data. Without affecting the usability of the data, the watermark is scattered in the databases evenly and hard to be detected. What's more, it keeps the distribution of the data. Experiments have shown that the algorithm is robust against various forms of attacks.

Published in:

Information Assurance and Security, 2007. IAS 2007. Third International Symposium on

Date of Conference:

29-31 Aug. 2007