Relational Database Watermarking Algorithm Based on Comparison Table

Abstract:

To reduce the algorithm complexity and improve performance, comparison table is created, and then encrypted by a randomized ten-bit serial number. Serial number forms the first key named key1, and the encrypted comparison table forms the second key named key2. Watermarking image is transformed into a binary bit stream. By using tuples primary key, key1 and key2, each tuples unique Id is computed. According to the watermarking length, all tuples are divided into different groups. Using tuple Id, by searching the encrypted comparison table, each tuple group can embed one bit information of watermarking. Robustness and security of this algorithm are tested by experiment.

• Periodical: Applied Mechanics and Materials (Volumes 433-435)
• Pages: 1800-1804
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.433-435.1800
• Online since: October 2013
• Authors: Mei Ting Wang
• Keywords: Comparison Table, Database Watermarking, Digital Watermarking, Relational Database

References

[1] Decai Huang, Yao Yao, Duanyang Liu, Weihua Gonlg: Computer Application and Software (in Chinese) Vol. 26 (2009), p.81.

[2] Rakesh Agrawal, Jerry Kieman: Proceedings of the 28th VLDB Conference. (2002), p.155.

[3] Sion. R, Atallah. M, Sunil Prabhakar. Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. SIGM OD(2003), p.98.

DOI: 10.1145/872757.872772

[4] Zhihao Zhang, Xiaoming Jin, Jianmin Wang, Deyi Li: Proceedings of the Third International Conference on Machine Learning and Cybernetics. (2004), p.1739.

[5] Ruimin Ma, Jihong Chen. Journal of Computer Applications (in Chinese) Vol. 32 (2012), p.2268.

[6] Bin Hu, Ronghua Shi, Peifu Peng. Application Research of Computers (in Chinese) Vol. 24 (2007), p.144.

[7] Weicheng Tao, Zhiyong Li, Houfu Li Ronghua. Computer Engineering (in Chinese) Vol. 36 (2010), p.155.