Research on database watermarking based on Independent Component Analysis and multiple rolling

Abstract

Digital watermarking is an important branch of information hiding technology research field. It is a technology that embeds identifiable data into digital works. In order to protect the copyright of digital products, the basic idea is to embed confidential information in digital products such as images, audio, and video to realize data fusion. The current digital watermarking technology is mainly concentrated in the field of multimedia information (such as images, audio, and video) and made good progress. In this article, based on the large database capacity, and much numerical data characteristics, we proposed a separate component analysis on the database watermarking method. First, this article uses a one-way hash function as the marking algorithm to determine the tuple according to the user’s given key, the tuple primary key value, and the tuple scale that needs to be marked. Then the watermark is extracted through the key, and the watermarked information is taken out in the database. The matrix is separated by the ratio Independent Component Analysis algorithm, and the watermark is used to separate the matrix. This kind of watermark information is rolled up, and the information in the original database is kept independent of each other, and the embedded watermark information is changed by the smaller carrier. The Independent Component Analysis method is used to extract the watermark image, and the ratio Independent Component Analysis method is used to solve the problem of the influence of the uncertainty of the arrangement order. The experimental results show that the proposed method has a good detection effect.

Keywords

Data combination data fusion digital watermarking Independent Component Analysis information hiding hybrid system

Introduction

Database technology has grown from the mid-1960s and has now become an active subject area.¹ Database-based information systems are becoming information infrastructure in the areas of economy and government, and the value of information stored in databases is becoming increasingly high. Therefore, the security of database systems is becoming more and more important. In the new network environment, the database system needs to face more security threats, because the database system attacks are endless. Database system security technology refers to the security measures established for the database system to protect the database system software and the data in which it is not accidentally and maliciously caused by illegal copying, destruction, alteration, and leakage. At present, the database system security, network security, and operating system security together constitute the most important information system security research field.

In general, the security requirements of the database system can be summarized as integrity, confidentiality, and availability of three aspects.² The integrity of the database system mainly includes physical integrity and logical integrity. Physical integrity means that the data of the database are not affected by physical failures (such as hardware failures and power down), and it is possible to rebuild and recover the database in the event of catastrophic destruction. Logical integrity refers to the protection of the logical structure of the database, including the semantic integrity of the data and operational integrity. Semantic integrity mainly refers to the data access to logically satisfy the integrity constraints, and operational integrity mainly refers to the concurrency transaction to ensure the logical consistency of the data.

The confidentiality of the database means that unauthorized users are not allowed access to the data.³ It is generally required to identify and authenticate the identity of the database user and take a certain access control policy to ensure that the user can only access the authorization data. So that it can grant different access rights to different users of the same set of data. At the same time, it should also be able to track and audit the user’s access operation. In addition, it should be controlled that the user can obtain unauthorized data from the known data through reasoning, resulting in information leakage.

Database availability means that the authorized user should not deny the normal operation of the database, while ensuring the efficiency of the system, and give users a friendly human–computer interaction interface. In general, the confidentiality and usability of the database is a contradiction. The analysis and resolution of this contradiction constitute the security model of the database system and the main objectives of a series of security mechanisms.

Database watermarking

Introduction of database watermarking system

Database watermarking is to embed imperceptible and difficult to remove tags in the database by signal processing without damaging the content and availability of the database, so as to protect the security of the database. It cannot damage the contents of the database and availability under the premise of the purpose of protecting the database security.^3,4

From the signal processing point of view, embedded in the database, watermark signal can be seen as a strong background superimposed on a weak signal as long as the superimposed watermark signal strength is below the allowable distortion threshold of the database availability. The watermark signal can be embedded in the database without satisfying the requirements of the concealment without affecting the availability of the database.

From the perspective of digital communications, database watermark embedding can be understood as a narrowband signal (watermark) on a wideband channel (carrier database) which uses spread spectrum communication technology.^4–6 Although the watermark signal has a certain amount of energy, the energy distributed to any frequency in the channel is difficult to detect. The decode (detection) of the watermark is a problem of detection of weak signals in a noisy channel. The database watermarking system consists of four parts: watermark generation, watermark embedding, watermark extraction, and watermark detection. The watermark signal is generated under key control, typically a binary bit sequence.⁷ The watermark signal may contain adaptive information to extract the characteristics of the database; may also contain data owner information, such as trademark logo and copyright text; generally need to be processed before the signal conversion; and then used to generate watermark signal. By extracting the feature of the relational data, and by appropriate transformation processing, the watermark channel is obtained with the participation of the key. The embedding and detection of watermark signals are carried out under key control, which is shown in Figure 1.

Figure 1.

Database watermark generation and embedding process.

The process of database detection generally does not require the original database to participate. The use of detection and extraction of the watermark signal can be the database for copyright certification and integrity verification. Furthermore, you can achieve the location of data tampering and piracy tracking. If the watermark contains data owner information, it can be obtained by preprocessing the watermark signal. In the database watermarking system, the watermarking hidden algorithm can be made public. Watermark generation, transformation processing, watermark carrier channel acquisition, watermark embedding, detection and extraction, and so on are completed under the control of the key, and the security of the system depends on the key. Figure 2 shows the watermark detection and extraction process.

Figure 2.

Database watermark detection and extraction.

The process of database watermarking involves several key algorithmic steps that have a significant impact on the performance of the database watermark.^8,9 These algorithms are watermark signal generation, watermark carrier channel acquisition, relationship, tuple tag, watermark embedding, and watermark detection and extraction. These complete steps form the key to the entire database model.

Basic model of database watermarking

According to the characteristics of the digital watermarking system, the database watermarking system can be represented by an octet: Watermark Database (WD) = (R, K, W, G, E, A, D, X).

In the model, R represents the set of relational data sets R, K represents the set of watermark keys K, and W represents a set of watermark signals W.

In general, the database watermark signal can be expressed as

WD = (R, K, W, G, E, A, D, X)

(1)

w = {w (k) | w \in U, k \in \hat{w}}

(2)

Among them, W is the watermark signal domain; can be image, graphics, text, and so on; and is generally a binary form, that is, U is the output of the above (0, 1). G denotes a watermark generation algorithm, that is, using the watermark key K and the relational data set R to collect the watermark signal.

In some cases, the generation of watermark signals also incorporates the copyright information given by the data owner, such as trademark patterns, copyright statements, and so on. In this case, the copyright information can be merged into a generalized watermark key. Set E to represent the watermark embedding algorithm, that is, embed the watermark signal W into the relational data under the control of the key K, so that Rw is obtained.

A represents the watermark attack algorithm,^5,9 that is, the attacker uses the forged key, attacking watermarked relational data set Rw to get Rw.

D indicates the watermark detection algorithm. Furthermore, for different watermark types, the watermark extraction algorithm X may contain different authentication functions. According to the watermark information W extracted by X, the data owner can be copyrighted for the robust watermark. For the fragile watermark, the authenticity and integrity of the data can be verified and tampered with the data, and the data can be recovered. It uses digital fingerprint technology to track pirates.

Research on database watermarking based on independent component and multiple rolling

Independent Component Analysis introduction

Independent Component Analysis (ICA) is originated from the blind source separation in signal processing technology. The blind source separation is based on the statistical characteristics of the input source signal without knowing the source signal and the transmission channel parameters,¹⁰ and only recovered by the received aliasing signal, which is the process of each source signal. Independent vector analysis is a new method of signal processing and data analysis in the process of blind source separation. Because of its statistical properties, it is not sensitive to large distortion and noise. Therefore, it is applied to watermarking algorithm that has a strong anti-distortion and anti-noise ability.

ICA technology is a new blind source separation¹¹ technology developed in recent years. In the absence of any other a priori information, the source signal is extracted directly from the observed signal only on the basis of the statistical independent nature of the source signals, which is used in image signal processing, speech signal processing, and biomedical signal processing, and has a significant practical value.

“Blind source” has two meanings: the source signal cannot be observed, and how the source signal is mixed is unknown. Obviously, blind source separation^1,9 is a natural choice when it is difficult to establish its mathematical model based on the transmission characteristics from the source to the sensor, or if the prior knowledge of transmission is not available. The core problem of blind source separation is the learning algorithm of separation (or de-mixing) matrix. The basic idea is to extract statistical independent features as input representation without losing information.

ICA method is a method of mixing matrix in blind source separation. Both principal components analysis and singular value decomposition are linear transformation, but the latter two can only decompose the data according to the energy size to eliminate the second order between the data correlation, while ICA is able to eliminate the high-order correlation of input data (Figure 3).¹²

Figure 3.

The blind signal processing model.

The main idea is, by ICA, from a group of observed signals: to arrive at a statistical independent source estimated value.

In 1994, Pierre Comon explained the concept of ICA, and proposed a cost function based on high-order construction algorithm, and obtained an adaptive method of separating matrix, which makes it possible to carry out blind signal separation on-line. Tony Bell and Terry Sejnowski proposed the method of information maximization, that the maximum difference in neural network output information difference entropy means that the input and output of the interaction between the maximum information and the use of random gradient reduction learning method to achieve the difference in the maximum Lee et al. The extended maximum entropy fractionation algorithm estimates the kurtosis of the signal, distinguishes the Gaussian signal from the sub-Gaussian signal, and the breakthrough cannot be used simultaneously for the separation limit of the super Gaussian signal and the sub-Gaussian signal. We have studied a fixed point algorithm for independent vector analysis and proposed a method to extract an independent component from the signal and obtain a fast algorithm of ICA.

First, the observation signal is averaged,¹³ which is the most basic and necessary step of the ICA algorithm. The process is to subtract the mean vector m = E{x} from the observed signal x, so that x becomes the zero mean vector, which means the estimated value y of the source signal s obtained by ICA is also zero-mean. Then the x is whitened to remove the correlation between the input vectors, so that the covariance matrix of the data vector v after whitening is a unit matrix, which is convenient for the separation matrix to be separated. It could be visible at this time, B = WV. Then, the objective function optimization algorithm is used to process the output vector separated by the separation matrix and the data vector after whitening, and the modification amount of the separation matrix weight is determined and updated. The separation matrix after pre-whitening is the orthogonal moment and the array. When the algorithm converges, the output vector y is the estimated source signal vector (Figure 4).

Figure 4.

Algorithm principle.

Common ICA algorithm

At present, the common ICA algorithm^4,10 can be divided into two broad categories: one is based on the batch operation of a related criterion function of the algorithm—the advantages of such algorithms are independent of any distribution of components that are suitable, but they generally need to be complicated matrix arithmetic or vector operations, such as joint approximation of feature matrices and fourth-order blind identification—and the other is an adaptive algorithm based on stochastic gradient method. These algorithms can be implemented by neural networks to ensure convergence to a corresponding. But the main problem is that the convergence of the algorithm is slow, and the correct selection of the learning rate parameters plays a decisive role in convergence, such as minimizing mutual information, InfoMax, and so on.

From the above data mixed model and its assumptions can be seen, ICA signal separation when a prior information is very small, which can be successfully used ICA signal separation of mathematical basis lies in the mathematical statistics of the central limit theorem. The central limit theorem tells us that the distribution of the sum of multiple independent Gaussian random variables is closer to the Gaussian distribution than the respective random variables. Therefore, it is possible to determine whether or not an independent signal is obtained by performing a non-Gaussian metric on the respective components of the output vector y.

There are two kinds of non-Gaussian measures: the kurtosis of random variables and negative entropy.

The kurtosis of the random variable y is defined as

Kurt (y) = E {y^{1}} - 3 (E {y^{2}})

(3)

For the separation process after whitening, the covariance matrix of the output vector is the unit matrix, and the kurtosis becomes

Kurt (y) = E (y^{4}) - 3

(4)

The kurtosis of the Gaussian random variable is zero, and the kurtosis of the Gaussian variable is not zero. The positive variance of the random variable is called the super-Gaussian variable, and the negative kurtosis random variable is called the sub-Gaussian variable.

The negative entropy of the random variable y is defined as

I (y) = H (y_{gs}) - H (y)

(5)

where the entropy of y is

H (y) = \int p (y) \log (y) dy

(6)

Ratio ICA database watermarking scheme

It should be noted that the traditional ICA method in the solution of the separation matrix, by the mixed matrix A, is prone to estimate the order of the signal, inconsistent with the original signal situation. Therefore, when the ICA method is applied to the digital watermarking technique, it is necessary to consider the arrangement order uncertainty first, so as to ensure that the watermark information^1,14 can be extracted accurately when the watermark is extracted. For the uncertainty of the amplitude of the ICA method, the uncertainty of the amplitude can be tolerated when the digital image information is embedded as a watermark. This is because the magnitude of the ICA method is scalable and scaled. If the amplitude occurs, reversal of the situation will not affect the understanding of digital images.

Based on the above considerations, the ICA algorithm can be used to embed the digital watermark, which can effectively guarantee the accuracy of the watermarking process. The ICA algorithm is mainly aimed at the mixed separation of two images, which is easy to implement in the engineering, and is obtained from the case of matrix mixing, which is not affected by the probability distribution of the original signal.

Without loss of generality, it is assumed that the two sets of different original signals s₁ and s₂ are input as one-dimensional vectors of the same size.

The mixed matrix A gets the mixed signal

x_{1} (k) = a_{11} s_{1} (k) + a_{12} s_{2} (k)

(7)

x_{2} (k) = a_{21} s_{1} (k) + a_{22} s_{2} (k)

(8)

Set

y_{1} (k) = a_{11} s_{1} (k), y_{2} = a_{12} s_{2} (k)

(9)

b_{1} = a_{21} I a_{11}, b_{2} = a_{22} I a_{12}

(10)

x_{1} (k) = y_{1} (k) + y_{2} (k)

(11)

x_{2} (k) = b_{1} y_{1} (k) + b_{2} y_{2} (k)

(12)

Generation of watermark independent component and marking of watermark locations

The generation of the watermark information uses a method in which a binary image is mapped into bit information. In the watermark embedding process, we map the image as copyright information into a binary string, generate watermark bit information, and then repeatedly embed it into the redundant data of the database. When detecting, recombine according to the extracted watermark information bits to form a complete watermark information. The watermarked image is processed by the ICA method to generate several watermarked independent components. The process is called watermark component generation.

Algorithm 1. MATLAB converts binary images to binary
imdata=imread(‘watermark.jpg’); imshow(imdata); BinSer=dec2bin(imdata,8); BinSer=BinSer’; FileName=[num2str(size(imdata,1)), ‘_’,num2str(size(imdata,2)),‘_’,num2str(size(imdata,3)),‘.txt’] fid=fopen(FileName,‘w’); fprintf(fid,‘%c’,BinSer(:)); fclose(fid); clear all

Due to the frequent variability of the database data, the watermark needs to be embedded in the database in a decentralized form. Since the specific part of the watermark is embedded in a specific tuple, it is necessary to find the tuples used for embedding when extracting the watermark.⁸ To find the same tuple, it is necessary to mark the tuple, that is, for each tuple assigned a role similar to the ID number of the tag ID. For a tuple, it is necessary to ensure that the watermark can be found using the same tag after the watermark embedding, good intentional modification, or malicious attack. Therefore, the key step of embedding watermark is to use the marking algorithm to calculate the ID value of the primary key. The basic idea of the tagging strategy is to first use the encrypted single hash function, such as the MD5 function, to determine which tuples need to be tagged based on the user’s given key and tuple primary key values and the tuple to be marked, and then the number of bits determine the attribute of the tag and the position of its bit. This will use some of the numeric values of some of the tuples in the relational database as a token. In this way, the bits of many bit-mark combinations in the entire relational database are embedded watermark information. The attribute of the tuple, the bit position of the attribute, and the specific bit value are determined by the algorithm of the key, the tuple primary key value, and the tuple proportional control algorithm that needs to be marked. The key, tuple tag, the number of markup attributes, and the number of bits are known only to the owner of the relational database. In order to ensure that the database can resist attacks, an effective marking algorithm must have strong robustness. Inspired by literature,^15-17 in this article, a one-way hash function is used as the marking algorithm, which always outputs a fixed length hash value for a certain length of input message, and the hash function is characterized by the easy computation of the forward calculation, and the difficulty of the reverse computer is greatly improved (Figure 5).

Figure 5.

Watermark independent component generation chart.

Watermark roll representation and watermarking information embedding

Assuming that the vector W represents a one-dimensional watermark vector and the vector D represents the truncated database data equal to the W vector, respectively, whereby a multiplexed signal can be obtained, the following mathematical form can be obtained using a mixed matrix x satisfying certain conditions

\begin{matrix} \overset{x_{1}}{K_{1}} = A \times_{D_{1}}^{W} =_{a_{21} W + a_{22} D_{1}}^{a_{11} W + a_{12} D_{1}} \\ \overset{x_{2}}{K_{2}} = A \times_{D_{2}}^{K_{1}} =_{a_{21}^{2} W + a_{21} a_{22} D_{2} + a_{22} D_{2}}^{a_{11} a_{21} W + a_{11} a_{22} D_{1} + a_{12} D_{2}} \\ \cdot \cdot \cdot \cdot \cdot \cdot \cdot \\ \overset{K_{m}}{x_{m}} = A \times_{D_{m}}^{K_{m - 1}} \end{matrix}

(13)

The embedding of watermarks in a relational database^6,14 is based on the following two assumptions: the watermark embedding object is only a numeric attribute in a relational database, and the numeric attribute values in a relational database can tolerate minor changes. Redundancy in the database refers to the redundant space of the embedded watermark, which is the sum of the data changes that can be used in the database. Relational database watermarking technology embeds the copyright information by embedding the watermark information into the database. In order to avoid the modification of the numerical value beyond the acceptable range, it is necessary to assume that the acceptable standard is limited to protect the value of the data. If the scope of the modification is too large, it will affect the normal use of the data; if too small, the redundant space is too small, and watermark information cannot be embedded. There are two ways to calculate redundant information in a database:

Using the mean square error δ: The mean square error is an index to describe the data mutation (error). The Gaussian theory of accidental error can be used to know that the error is usually between (–δ, δ), in order to obtain the most suitable allowable deformation value, which is very important.

Absolute errors: For some databases, if there is some modification beyond which the data will cause a change in the meaning of the data, the modification of each data can only be within its scope and not beyond a certain range. The absolute error for each data cannot be greater than a certain value.

The main steps of the embedded algorithm are as follows:

The primary key and the numeric attribute of the relational database are arranged in a certain order, and the corresponding value of each primary key of each tuple is calculated according to the password hash function SHA: ID=Hash(k, P_keyi, k), where k is the key, which is owned by the database owner. Because the primary key values of different tuples in the database are different, according to the nature of the hash function, the corresponding ID values are also different. Therefore, the tuple has a one-to-one correspondence with the ID.

The data are selected according to the embedding factor γ, and then all the element groups are grouped according to different remainders according to the value of each tuple ID divided by the length L of the embedding watermark information E(i).

Embedding the ith bit E(i) of the watermark information into the grouping result of the corresponding tuple according to the control factor ω, checking the validity of the data embedded in the watermark, and recovering the data if the boundary is exceeded.

Algorithm 2. Watermark insertion algorithm
//InsertaplainwatermarkWintorelationRinformof0, 1sequences, returnmarkedR //Theparametersk, L, γ, and ν areallprivatetotheowner. 1) calculateL-bitEMCE[L]=H(k$concatenateW)//Listhelengthofwatermark 2) foreachtuplerRdo 3) t=H(kconcatenater.P_key_i) 4) if(tmodγequals0)then//markthistuple 5) attribute_indexi=tmodν//markattributeAi 6) bit_indexj=tmodξ//markjthbit 7) watermark_indexk=tmodL//usethek-thbitof0, 1sequencestomark 8) mark_bitm=EkXOR(kmod2)//getthevalueofmarkedbit 9) setthej-thleastsignificantbitofr.Aitom 10) if(notwithin_usability(new_data))//checktheavailability 11) rollback 12) elsecommit 13) returnR

Algorithm 2. Watermark insertion algorithm

//InsertaplainwatermarkWintorelationRinformof0, 1sequences, returnmarkedR
//Theparametersk, L, γ, and ν areallprivatetotheowner.
1) calculateL-bitEMCE[L]=H(k$concatenateW)//Listhelengthofwatermark
2) foreachtuplerRdo
3) t=H(kconcatenater.P_key_i)
4) if(tmodγequals0)then//markthistuple
5) attribute_indexi=tmodν//markattributeAi
6) bit_indexj=tmodξ//markjthbit
7) watermark_indexk=tmodL//usethek-thbitof0, 1sequencestomark
8) mark_bitm=EkXOR(kmod2)//getthevalueofmarkedbit
9) setthej-thleastsignificantbitofr.Aitom
10) if(notwithin_usability(new_data))//checktheavailability
11) rollback
12) elsecommit
13) returnR

We think that the mean variance is ideal for the processing of sampled data with the same distribution and little difference, and the range of different fields in the relational database will be different, which will result in the calculation of the obtained value only for some data items,^10,18 limiting the capacity of watermark embedding. For the database, it is more to consider the change of the embedded data compared with the original data and the usability of the data after embedding the information. In this case, the absolute allowable error is used as a measure of the embedding of the watermark.

We carefully analyze these allowable error, select the actual relationship model database to experiment, from which to filter out all the data items, after the group of data items to discuss the increase in the database redundant space and watermarking method. In watermark coding, the combination of the key is to invalidate the database field and watermark distribution frequency analysis, which increases the difficulty of deletion and forgery.

Watermark extraction

Watermark extraction is the inverse of watermark embedding. In the process of watermark extraction, we need several system parameters, namely, watermark key k, data error ξ, embedding factor γ, and control factor ω. First, the token value of each tuple is calculated according to the password hash function. The primary key and the numeric attribute of the relational database are restored according to the labeling algorithm, and the data structure diagram of the watermark embedding is restored according to the embedding factor and the string length L of the embedded watermark. The embedded data are grouped into Li=Hash(k, P_keyi, k), Watermark_indexk[i]=LimodL, to find out the specific location of the watermark embedding of a tuple in the relational database, and the label Li and control of the data as described above. The modulus of the factor ω is determined. That is, the specific position is embedded, P=Limodω, the watermark binary character is taken out, and all the watermark information is continuously studied from the relational database.

In the detection process, the embedded process mechanism should be used to restore the watermark. At the same time, it should be considered that the database to be detected may be modified or the specified attribute of the detected database may have data without embedded watermark information, so the detection process may also extract the error watermark information in the data. Therefore, it is necessary to correct and judge the extracted watermark information. The extraction process of the watermark is similar to the operation of the embedding process, the difference is that the watermark information is extracted from the data and selected by the majority election method to obtain an accurate. The watermark information bits are then restored to the original watermark information.

Algorithm 3. Watermark extraction algorithm
//AlgorithmtoreturnawatermarkM[]fromrelationR //parametersk, L, α, ξandνarealsoprivatetotheowner. 1 fors=0toL-1do 2 DM[s]=“//initializedetectedmarkcode 3 count[s][0]=0, count[s][1]=0//initializecounter 4 foreachtupler∈Rdo 5 t=H₁(kconcatenater.P) 6 if(tmodγequals0)then//selectthistuple 7 i=select_attribute()//marki-thattribute 8 j=tmodξ//selectj-thbit 9 k=tmodL//markthek-thbitofEMC 10 m=(j-thLSBofr.Ai)XOR(kmod2) 11 count[k][m]=count[k][m]+1//addthecounter 12 fors=0toL-1//getthewatermark 13 if(count(s][0]>=count[s][1) 14 thenM[s]=0elseM[s]=1//thefinalbitvalue 15 returnM[]

Algorithm 3. Watermark extraction algorithm

//AlgorithmtoreturnawatermarkM[]fromrelationR
//parametersk, L, α, ξandνarealsoprivatetotheowner.
1 fors=0toL-1do
2 DM[s]=“//initializedetectedmarkcode
3 count[s][0]=0, count[s][1]=0//initializecounter
4 foreachtupler∈Rdo
5 t=H₁(kconcatenater.P)
6 if(tmodγequals0)then//selectthistuple
7 i=select_attribute()//marki-thattribute
8 j=tmodξ//selectj-thbit
9 k=tmodL//markthek-thbitofEMC
10 m=(j-thLSBofr.Ai)XOR(kmod2)
11 count[k][m]=count[k][m]+1//addthecounter
12 fors=0toL-1//getthewatermark
13 if(count(s][0]>=count[s][1)
14 thenM[s]=0elseM[s]=1//thefinalbitvalue
15 returnM[]

Simulation experiment

We use the forest coverage type distribution data set in the University of California Irvine (UCI) Knowledge Discovery in Databases Archive as a test set. The data set contains 581,012 data, each of which contains 54 attribute fields. In order to simplify the experimental operation, we take a subset of the database as the experimental database of this chapter. We select eight attributes such as ID, Elevation, Aspect, Slope, distance hydrological Horizontal_Distance_To_Hydrology, Vertical_Distance_To_Hydrology, Horizontal_Distance_To_Roadways, Hillshade_9am, and Hillshade_Noon, and select the first 30,000 records to form the experimental database. The experimental environment is Pentium G620, 4 GBRAM, SUNJDK1.41, using Windows 7, background database system using Microsoft Office Access 2010; front-end programming environment is java; and database is accessed by Java DataBase Connectivity (JDBC). The watermark generation algorithm of this experiment is implemented by MATLAB. Attack on the watermark is the process that may weaken the watermark signal. Watermarking system should be able to protect the original copyright information of the data and prevent the data theft of various forms of malicious attacks on the relational database, and common malicious attacks are the following (Figure 6).

Figure 6.

The flowchart of watermark embedding.

Subset selection attack

An attacker does not use all the properties and tuples of the watermarking library but uses only a subset of its attributes or tuples to erase the watermark. Sub-extraction attacks on the watermark caused direct damage and will lose part of the watermark information. However, when the watermark information in the partial carrier data reaches a certain threshold, the watermark information can be recovered. For tuple extraction attacks, in the design of the database watermark embedding strategy, the carrier data can be grouped. Each group repeatedly embedded watermark sequence, and it can effectively prevent the subset of extraction attacks. For attribute extraction attacks, because the integrity of the tuple is destroyed, the watermark and tuple synchronization relationship is also generally destroyed. To prevent this from happening, it is possible to determine the embedding position only by the tuple primary key and the key when the watermark is embedded (assuming that the primary key is deleted or tampered will seriously affect the availability of the data).^19,20 In this way, the watermark embedding position is not dependent on other attributes, then the attribute extraction attack does not destroy the synchronization relationship between the watermark and the tuple, and the watermark information can be effectively recovered from the partial attribute data (Figure 7).

Figure 7.

Subset selection attack.

The results show that the more subsets the attacker chooses, the more watermarks are extracted during the detection, and the higher watermark images can still be extracted well when 30% data are selected. The attacker can successfully extract the watermark copyright information after selecting 30% to 100% by means of subset selection.

Subset addition attack

An attacker has stolen the entire database or part of the database plus a portion of the data in the database. The attacker added a portion of the malicious tuple to the watermark vector database. For watermark, synchronization only depends on the watermark of the current tuple. The added tuple data generally do not affect the watermark in the original carrier data. The essence of the subset added attack is to increase the watermark-free data, thereby reducing the embedding strength of the watermark. For watermarking of packet embedding, the synchronization of the watermark is generally related to other tuples in the group, and the added tuples may destroy the watermark in the original carrier data. Therefore, the effective way to prevent the subset from adding is to make the embedding of the watermark in the tuple only related to the current tuple, so that the synchronization information of the watermark is kept in the current tuple, regardless of the other tuples that are maliciously added (Figure 8).

Figure 8.

Subset addition attack.

The results show that the increase of subset has little effect on the copyright information image. The original 30,000 tuples contain complete watermarking information. After increasing the amount of data from 30,000 to 60,000, the watermarking information is affected to a certain extent, which makes the watermarking image noisy, but the watermarking copyright image still shows good robustness.

Subset change attack

An attacker has stolen the entire database or part of the database and changed some of the data. The attacker changed part of the data in the watermark vector database. Subset changes are the most common watermark attacks, depending on the object and method of change, which can be divided into least significant bit (LSB) bit reset and random data replacement, similar to rounding attacks. LSB reset attacks generally use LSB bit replacement algorithm for the database watermark, by resetting part of the LSB bit, to achieve the purpose of damaging the watermark. General LSB bit reset means include bit flip and random bit replacement. The watermark embedded by the LSB bit reset algorithm is generally random and balanced. For the LSB bit flipping attack, if the attacker wants to accurately attack the original watermark carrier bit, it is equivalent to distributing the original watermark position bit sequence to the small probability region, but obviously exposes the attacker’s piracy intention. In fact, the attacker uses more LSB random bit replacement attacks, that is, part of the specific LSB bit reset random bits. Generally, with the increase in the proportion of bits, the degree of damage to the watermark increases, but the availability of the carrier data decreases.

Similarly, random data replacement and similar rounding attacks can also cause damage to the watermark, which is essential by adding noise to weaken the watermark signal. At the same time, the availability of the carrier data is correspondingly reduced. Watermark algorithm designers generally improve the watermarking of the embedded factor to improve the robustness of the watermark to prevent such attacks (Figure 9).

Figure 9.

Simulation experiment of subset after attack.

From the watermark attacks described above, it can be seen that some of the attack ways such as the addition and extraction of the subsets are essentially the result of the loss of the matching information of some attribute values, or the partial data information. We use the most common subset to change the attack as the primary means. It uses the ratio ICA method to perform 100 Monte Carlo simulation comparison experiments on 150 × 30 and 300 × 60 watermark images. The simulation results are shown in Figure 9.

Experimental simulation attackers randomly change the database content (5%, 20%, 40%, and 50%), and the results are shown in Figure 10. It can be identified from the experimental results that when the data changes by 40%, it is difficult to identify when it exceeds 50%. From the perspective of relational database analysis, if the data in the database have undergone great changes, the use of data is also destroyed. This experiment proves the anti-attack performance of the watermark from the subjective and objective point of view, which proves that the watermark embedding model is not only simple in the algorithm but also has good detection effect and strong controllability.

Figure 10.

Simulation experiment under random attack.

Analysis

ICA method is a new method of recent rise, with strong vitality. Here we combine the ICA method and watermark information detection method, so that the watermark information embedded in the database is completely disturbed and effectively prevents unauthorized attacks. This ICA method uses a new ratio ICA extraction algorithm that accurately and efficiently extracts watermark information from the database, and the extraction process does not require the original database. The data show that the method has high feasibility and robustness.

Conclusion

In the rapid development of the network today, with the increasing use of the database, how to effectively protect the database copyright is a new issue of database security. In recent years, some scholars have proposed the use of digital watermarking to achieve the copyright protection of the database, although it has achieved some results, but the research model and algorithm are not mature.

This article presents a database watermarking method based on ICA and multiple data. The ICA method is used to extract the watermark image, and the ratio ICA method is used to solve the problem of the influence of the uncertainty of the arrangement order. This method is more intuitive than previous methods, and it is easy to support watermarking recognition. By introducing various attack models, we evaluate the performance of the algorithm. The simulation results show that the method has good effectiveness, feasibility, and robustness.

Footnotes

Handling Editor: Daming Zhou

Declaration of conflicting interests

The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

Funding

The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work is supported by the National Natural Science Foundation of China (71371172), the Key Scientific Research Project Plan of Universities in Henan Province (18A520051), Henan Aviation Economy Research Center, and Zhengzhou Institute of Aviation Industry Technology.

ORCID iD

Zaihui Cao

References

Pan

. Rolling bearing fault diagnosis based on one-dimension blind source separation. J Electron Meas Instrum 2014; 27: 535–542.

Wang

Xiang

Yin

. Extraction of weak crack signals based on ICA. J Changsha Univ Sci Technol 2014; 2014: 74–80.

Pan

Chi

et al . Acoustical diagnosis for gear box combined failures based on frequency domain blind deconvolution. J Vib Shock 2013; 32(7): 154–158.

Wang

See

et al . Effective recognition of facial micro-expressions with video motion magnification. Multimed Tools Appl 2017; 76: 21665–21690.

Zhou

Wand

Wang

et al . Automatic recognition method of surface defects based on nonsubsampled contourlet transform and PCNN. J Basic Sci Eng 2013; 2: 174–184.

Cai

Guo

Wang

et al . Score-informed source separation based on real-time polyphonic score-to-audio alignment and Bayesian harmonic model. In: 2014 international conference on computational intelligence and communication networks (CICN), Bhopal, India, 14–16 November 2014, pp.672–680. New York: IEEE.

Faraji

. Face recognition under varying illuminations using logarithmic fractal dimension-based complete eight local directional patterns. Neurocomputing 2016; 199: 16–30.

Chetty

White

Singh

et al . Multimodal activity recognition based on automatic feature discovery. In: 2014 international conference on computing for sustainable global development (INDIACom), New Delhi, India, 5–7 March 2014, pp.632–637. New York: IEEE.

Kaushik

Dua

. Digital image watermarking using BFO optimized DWT and DCT & comparison between DWT, DWT + DCT, DWT + DCT + BFO. Int J Recent Res Aspects 2014; 1: 13–16.

10.

Rani

Choudri

Murthy

. Survey on robust and reversible watermarking for relational data. Int J Comput Appl 2016; 139(9): 31–34.

11.

Kumar

Shankar

Choudhary

et al . A big data MapReduce framework for fault diagnosis in cloud-based manufacturing. Int J Prod Res 2016; 54(23): 7060–7073.

12.

Warif

NBA

Wahab

AWA

Idris

MYI

et al . Copy-move forgery detection: survey, challenges and future directions. J Netw Comput Appl 2016; 75: 259–278.

13.

Papushoy

Bors

. Image retrieval based on query by saliency content. Digit Signal Process 2015; 36: 156–173.

14.

Puri

. Vulnerability assessment of multi biometric systems. Moonee Ponds, VIC, Australia: The Personnel Risk Management Group Pty Ltd, 2015.

15.

Zhou

Al-Durra

Zhang

et al . Online remaining useful lifetime prediction of proton exchange membrane fuel cells using a novel robust methodology. J Power Sources 2018; 399: 314–328.

16.

Zhou

Thu

Breaz

et al . Global parameters sensitivity analysis and development of a two-dimensional real-time model of proton-exchange-membrane fuel cells. Energ Convers Manage 2018; 162: 276–292.

17.

Zhou

Al-Durra

Matraji

et al . Online energy management strategy of fuel cell hybrid electric vehicles: a fractional-order extremum seeking method. IEEE T Ind Electron 2018; 65(8): 6787–6799.

18.

Nawrocki

Wählisch

Schmidt

et al . A survey on honeypot software and data analysis. arXiv: 1608.06249, 2016.

19.

Cui

. The eigenvalue problem for Caputo type fractional differential equation with Riemann-Stieltjes integral boundary conditions. J Funct Space 2018; 2018: 2176809.

20.

Chen

O’Regan

et al . Positive solutions for a system of semipositone fractional difference boundary value problems. J Funct Space 2018; 2018: 6835028.