This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 The Third International Symposium on Information Assurance and Security
Second-LSB-Dependent Robust Watermarking for Relational Database
Manchester, United Kingdom
August 29-August 31
ISBN: 0-7695-2876-7
ASCII Text
x 
 
Xiangrong Xiao, Xingming Sun, Minggang Chen, "Second-LSB-Dependent Robust Watermarking for Relational Database," Information Assurance and Security, International Symposium on, pp. 292-300, 2007 The Third International Symposium on Information Assurance and Security, 2007.
 
 
BibTex
x
 
@article{ 10.1109/IAS.2007.25,
author = {Xiangrong Xiao and Xingming Sun and Minggang Chen},
title = {Second-LSB-Dependent Robust Watermarking for Relational Database},
journal ={Information Assurance and Security, International Symposium on},
volume = {0},
year = {2007},
isbn = {0-7695-2876-7},
pages = {292-300},
doi = {http://doi.ieeecomputersociety.org/10.1109/IAS.2007.25},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Information Assurance and Security, International Symposium on
TI - Second-LSB-Dependent Robust Watermarking for Relational Database
SN - 0-7695-2876-7
SP292
EP300
A1 - Xiangrong Xiao,
A1 - Xingming Sun,
A1 - Minggang Chen,
PY - 2007
KW - relational database; digital watermarking; double collection; second-LSB; threshold
VL - 0
JA - Information Assurance and Security, International Symposium on
ER -
 
Xiangrong Xiao, Hunan University, China
Xingming Sun, Hunan University, China
Minggang Chen, Hunan University, China
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.
Index Terms:
relational database; digital watermarking; double collection; second-LSB; threshold
Citation:
Xiangrong Xiao, Xingming Sun, Minggang Chen, "Second-LSB-Dependent Robust Watermarking for Relational Database," ias, pp.292-300, 2007 The Third International Symposium on Information Assurance and Security, 2007
Usage of this product signifies your acceptance of the Terms of Use.