A New Relational Database Watermarking Algorithm Based on Chaos

Abstract:

This paper proposed a new database watermarking algorithm based on a numerical attribute of database. Firstly, the copyright image was encrypted by a chaotic system to produce a binary sequence as the watermark signal. Then it used two hash functions to realize the watermark embedding. The first hash value was calculated by using the connection value of the key and the primary key. Then it filtered out the tuples whose corresponding hash value was even. The second double-hash value was calculated by using the connection of the key and the first hash value, which was used to label tuples and partition tuples. The first hash value was used as a control signal to adjust the parity of the candidate attribute bit when the watermark was embedded. Theoretical analysis and experimental results indicate that the algorithm reduces the amount of embedding watermark and improves the robustness and security of the watermark.

• Periodical: Advanced Materials Research (Volumes 971-973)
• Pages: 1485-1490
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.971-973.1485
• Online since: June 2014
• Authors: Yin Dan Han*, Jiang Feng Xu
• Keywords: Chaos, Hash Function, Ownership Protection, Relational Database, Watermarking

References

[1] Khanna S, Zane F. Watermarking maps: hiding information in structured data[C]/Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2000: 596-605.

[2] Agrawal R, Kiernan J. Watermarking relational databases[C]/Proceedings of the 28th international conference on Very Large Data Bases. VLDB Endowment, 2002: 155-166.

DOI: 10.1016/b978-155860869-6/50022-6

[3] Sion R, Atallah M J, Prabhakar S. Rights protection for relational data[J]. Knowledge and Data Engineering, IEEE Transactions on, 2004, 16(12): 1509-1525.

DOI: 10.1109/tkde.2004.94

[4] ZHU Qin, LIU Liangxu, LE Jiajin. Robust Algorithm for Relational Database Watermarking Based on m Sequence [J]. Journal of Chinese Computer Systems, 2008, 29(8): 1486-1490.

[5] ZHENG Guangming. Application of hamming code and voting in majority in the relational database digital watermarking[J]. Journal of Hunan Institute of Science and Technology(Natural Sciences), 2006, 18(3): 23-25.

[6] ZHOU Fei, ZHAO Huaixun. Relational database watermarking algorithm based on chaos and DCT[J]. Application Research of Computers, 2012, 29(2): 786-788.

[7] Xiang Yue, Li Junyi, Pan Jifang. Database Watermarking Algorithm Based on Virtual Primary Key[J]. Journal of Computer Research and Development, 2009, 46(Z1): 66-70.

[8] ZHAO Xuefeng, YIN Guofu. Research on digital image encryption method based on hybrid chaotic system[J]. Computer Applications, 2006, 26(4): 827-829.

[9] NIU Muxia, ZHAO Liang, HUANG Wenjun etc. Watermarking Relational Databases for Ownership Protection[J]. ACTA ELECTRONICA SINICA, 2003, 31(12): 2050-(2053).

[10] Kamran M, Suhail S, Farooq M. A robust, distortion minimizing technique for watermarking relational databases using once-for-all usability constraints[J]. Knowledge and Data Engineering, IEEE Transactions on, 2013, 25(12): 2694-2707.

DOI: 10.1109/tkde.2012.227