Abstract
In relational databases, embedding watermarks in integer data using traditional histogram shifting method has the problem of large data distortion. To solve this problem, a reversible database watermarking method without redundant shifting distortion is proposed, taking advantage of a large number of gaps in the integer histogram. This method embeds the watermark bit by bit on the basis of grouping. First, an integer data histogram is constructed with the absolute value of the prediction error of the data as a variable. Second, the positional relationship between each column and the gap in the histogram is analyzed to find out all the columns adjacent to the gap. Third, the highest column is selected as the embedded point. Finally, a watermark bit is embedded on the group by the histogram non-redundant shifting method. Experimental results show that compared with existing reversible database watermarking methods, such as genetic algorithm and histogram shift watermarking and histogram gap–based watermarking, the proposed method has no data distortion caused by the shifting redundant histogram columns after embedding watermarks on forest cover type data set and effectively reduces the data distortion rate after embedding watermarks.
Highlights
In the era of big data, how to protect data security in the database is an important issue
The method used is set as the histogram gap–based watermarking (HGW) experiment by Li et al.,[19] which generates a composite column as the primary key, and the length of the watermark is 48
We propose a new method of reversible database watermarking with low distortion and the originality of the method lies in the grate reduction of the distortion rate of the carrier data
Summary
In the era of big data, how to protect data security in the database is an important issue. The technology protects the rights of the database owner by modifying the data in the database and embedding the watermark containing the copyright information. In 2018, DH Hu et al.[18] proposed a reversible database watermarking method called genetic algorithm and histogram shift watermarking (GAHSW) based on numerical relational data distortion control. This method uses a genetic algorithm to group tuples and uses the HSW method to embed watermarks. This method improves the robustness of reversible database watermarking while reducing data distortion. The structure of the article is as follows: Section ‘‘Related work’’ describes the related work in the early stage of the paper; section ‘‘The proposed method’’ elaborates the basic ideas and main contents of the proposed method; experimental verification and result analysis were carried out in section ‘‘Results and analysis’’; and section ‘‘Conclusion’’ gives conclusions
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Distributed Sensor Networks
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
