Consistency preserving database watermarking algorithm for decision trees

Abstract

Database watermarking technologies provide an effective solution to data security problems by embedding the watermark in the database to prove copyright or trace the source of data leakage. However, when the watermarked database is used for data mining model building, such as decision trees, it may cause a different mining result in comparison with the result from the original database caused by the distortion of watermark embedding. Traditional watermarking algorithms mainly consider the statistical distortion of data, such as the mean square error, but very few consider the effect of the watermark on database mining. Therefore, in this paper, a consistency preserving database watermarking algorithm is proposed for decision trees. First, label classification statistics and label state transfer methods are proposed to adjust the watermarked data so that the model structure of the watermarked decision tree is the same as that of the original decision tree. Then, the splitting values of the decision tree are adjusted according to the defined constraint equations. Finally, the adjusted database can obtain a decision tree consistent with the original decision tree. The experimental results demonstrated that the proposed algorithm does not corrupt the watermarks, and makes the watermarked decision tree consistent with the original decision tree with a small distortion.

Keywords

Consistency preserving / Decision tree / Database watermarking / Data mining

References

[1] Z. Ruan, Y. Miao, L. Pan, et al., Visualization of big data security: a case study on the KDD 99 cup data set, Digital Commun. Networks 3 (4) (2017) 250-259.

[2] S. Yu, P. Muller, A. Zomaya, Special issue on “big data security and privacy”, Digital Commun. Networks 3 (4) (2017) 211-212.

[3] A.O. Almagrabi, A.K. Bashir, A classification-based privacy-preserving decision-making for secure data sharing in Internet of Things assisted applications[J], Digital Commun. Networks 8 (4) (2022) 436-445.

[4] D. Wu, B. Yang, R. Wang, Scalable privacy-preserving big data aggregation mechanism[J], Digital Commun. Networks 2 (3) (2016) 122-129.

[5] X. Wu, X. Zhu, G.Q. Wu, et al., Data mining with big data, IEEE Trans. Knowl. Data Eng. 26 (1) (2013) 97-107.

[6] J. Feng, L. Liu, Q. Pei, K. Li, Min-max cost optimization for efficient hierarchical federated learning in wireless edge networks, IEEE Trans. Parall. Distr. 33 (11)(2022) 2687-2700.

[7] H. Hamdoun, A. Sagheer, Information security through controlled quantum teleportation networks, Digital Commun. Networks 6 (4) (2020) 463-470.

[8] B.B. Mehta, H.D. Aswar, Watermarking for security in database: a review,in:2014 Conference on IT in Business, Indus-try and Government (CSIBIG), 2014, pp. 1-6.

[9] R. Agrawal, J. Kiernan,Watermarking relational databases, in:VLDB ’02: Proceedings of the 28th International Conference on Very Large Databases, 2002, pp. 155-166.

[10] M.K. Rathva, G.J. Sahani, Study on watermarking relational databases, Theory Pract. Math. Comput. Sci. 9 (2021) 161-171.

[11] S. Rani, R. Halder, Comparative analysis of relational database watermarking techniques: an empirical study, IEEE Access 10 (2022) 27970-27989.

[12] W. Wang, A. Men, B. Yang, et al., A novel robust zero watermarking scheme based on DWT and SVD, in: 2011 4th International Congress on Image and Signal Processing, vol. 2, IEEE, 2011, pp. 1012-1015.

[13] I. Kamel, M. AlaaEddin, W. Yaqub, et al. Distortion-free fragile watermark for relational databases, Int. J. Big Data Intell. 3 (3) (2016) 190-201.

[14] I.K. Waheeb Yaqub, Z. Aung, Distortion-free watermarking scheme for compressed data in columnar database, Proceed. 15th ICETE (2018) 343- 353. Porto, Portugal.

[15] C.C. Lin, T.S. Nguyen, C.C. Chang, LRW-CRDB: lossless robust watermarking scheme for categorical relational databases, Symmetry 13 (11) (2021) 2191.

[16] S. Yan, S. Zheng, B. Ling, et al., Lossless database watermarking based on order-preserving encryption, in: ACM Turing Award Celebration Conference-China (ACM TURC 2021), 2021, pp. 216-223.

[17] C.C. Lin, T.S. Nguyen, C.C. Chang, LRW-CRDB: lossless robust watermarking scheme for categorical relational databases, Symmetry 13 (11) (2021) 2191.

[18] A.A. Ismail, S.M. Darwish, Context-based zero database watermarking scheme based on evolutionary mechanism, in: International Conference on Advanced Machine Learning Technologies and Applications, Springer, Cham, 2021, pp. 1005-1015.

[19] A.K. Dwivedi, B.K. Sharma, A.K. Vyas, Watermarking techniques for ownership protection of relational databases, Int. Conf. Ad. Develop. Eng. Technol. 6 (1)(2012) 988-995.

[20] B.B. Mehta, U.P. Rao,A novel approach as multi-place watermarking for security in database, in:International Conference on Sam, 2014 arXiv.

[21] S. Melkundi, C. Chandankhede, A robust technique for relational database watermarking and verification, in: 2015 International Conference on Communication, Information & Computing Technology (ICCICT), 2015, pp. 1-7.

[22] R. Sion, M. Atallah, S. Prabhakar, Rights protection for relational date, IEEE Trans. Knowl. Data Eng. 16 (6) (2004) 1509-1525.

[23] M. Shehab, E. Bertino, A. Ghafoor, Watermarking relational data-bases using optimization-based techniques, IEEE Trans. Knowl. Data Eng. 20 (1) (2008) 116-129.

[24] Y. Li, R. Deng, Publicly verifiable ownership protection for relational databases, in: Proc. ACM Symp. Information, Computer and Comm. Security, 2006, pp. 78-89.

[25] S. Bhattacharya, A. Cortesi, A distortion free watermark framework for relational databases, in: Proc. Fourth Int’l Conf. Software and Data Technologies (ICSOFT ’09), 2009, pp. 229-234.

[26] M. Kamran, S. Suhail, M. Farooq, A robust, distortion minimiz-ing technique for watermarking relational databases using once-for-all usability constraints, IEEE Trans. Knowl. Data Eng. 25 (12) (2013) 2694-2707.

[27] M. Kamran, M. Farooq, A formal usability constraints model for watermarking of outsourced datasets, IEEE Trans. Inf. Forensics Secur. 8 (6) (2013) 1061-1072.

[28] L. Breiman, J.H. Friedman, R.A. Olshen, et al., Classification and regression trees (CART), Biometrics 40 (3) (1984) 358.