A Robust, Distortion Minimizing Technique for Watermarking Relational Databases Using Once-for-All Usability Constraints

被引:33
作者
Kamran, M. [1 ,2 ]
Suhail, Sabah [3 ]
Farooq, Muddassar [4 ,5 ]
机构
[1] Next Generat Intelligent Networks Res Ctr NexGIN, COMSATS Inst Informat Technol, Wah Cantt 47010, Wah, Pakistan
[2] Natl Univ Comp & Emerging Sci, Dept Comp Sci, Islamabad 44000, Pakistan
[3] Next Generat Intelligent Networks Res Ctr, Islamabad 44000, Pakistan
[4] Next Generat Intelligent Networks Res Ctr NexGIN, Islamabad 44000, Pakistan
[5] Inst Space Technol, Islamabad 44000, Pakistan
关键词
Data usability constraints; distortion free; database watermarking; data quality; right protection; ownership protection; robust watermarking;
D O I
10.1109/TKDE.2012.227
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Ownership protection on relational databases-shared with collaborators (or intended recipients)-demands developing a watermarking scheme that must be able to meet four challenges: 1) it should be robust against different types of attacks that an intruder could launch to corrupt the embedded watermark; 2) it should be able to preserve the knowledge in the databases to make them an effective component of knowledge-aware decision support systems; 3) it should try to strike a balance between the conflicting requirements of database owners, who require soft usability constraints, and database recipients who want tight usability constraints that ensure minimum distortions in the data; and 4) last but not least, it should not require that a database owner defines usability constraints for each type of application and every recipient separately. The major contribution of this paper is a robust and efficient watermarking scheme for relational databases that is able to meet all above-mentioned four challenges. The results of our experiments prove that the proposed scheme achieves 100 percent decoding accuracy even if only one watermarked row is left in the database.
引用
收藏
页码:2694 / 2707
页数:14
相关论文
共 20 条
[1]  
Agrawal R., 2002, Proceedings of the Twenty-eighth International Conference on Very Large Data Bases, P155
[2]  
Agrawal R, 2003, VLDB J, V12, P157, DOI [10.1007/s000778-003-0097-x, 10.1007/s00778-003-0097-x]
[3]  
Allan DW., 1997, The science of timekeeping
[4]  
Bhattacharya S, 2009, ICSOFT 2009: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON SOFTWARE AND DATA TECHNOLOGIES, VOL 2, P229
[5]   A public key cryptography based algorithm for watermarking relational databases [J].
Cui, Haiting ;
Cui, Xinchun ;
Meng, Mailing .
2008 FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, PROCEEDINGS, 2008, :1344-1347
[6]  
Deshpande Arti, 2009, 2009 2nd International Conference on Emerging Trends in Engineering and Technology (ICETET 2009), P664, DOI 10.1109/ICETET.2009.160
[7]  
Farfoura Mahmoud E., 2010, 2010 International Symposium on Parallel and Distributed Processing with Applications (ISPA 2010), P563, DOI 10.1109/ISPA.2010.63
[8]   A blind reversible method for watermarking relational databases based on a time-stamping protocol [J].
Farfoura, Mahmoud E. ;
Horng, Shi-Jinn ;
Lai, Jui-Lin ;
Run, Ray-Shine ;
Chen, Rong-Jian ;
Khan, Muhammad Khurram .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (03) :3185-3196
[9]   A fragile watermarking scheme for detecting malicious modifications of database relations [J].
Guo, HP ;
Li, YJ ;
Liu, AY ;
Jajodia, S .
INFORMATION SCIENCES, 2006, 176 (10) :1350-1378
[10]  
Gupta G, 2009, LECT NOTES COMPUT SC, V5905, P222, DOI 10.1007/978-3-642-10772-6_17