Abstract

Data watermarking technology is an effective means to protect the copyright of big data. In order to embed robust and highly available data watermarks, firstly, based on the game theory, a Nash equilibrium model between watermark robustness and data quality is established to solve the optimal number of data group. Then, the mapping relationship between data group and watermark bit is established by using secure hash algorithm.Finally, under the constraint of data usability, the improved particle swarm optimization algorithm is used to solve the optimal solution of data change for each data group, and then the data is changed accordingly to complete the embedding of watermark bit. In order to verify the copyright ownership of big data, the corresponding watermark extraction method is also given in this paper. Watermark extraction is the inverse process of watermark embedding. First, it traverses all the groups and extracts the bits that might be embedded in each group. Then, the actual embedded watermark bit is finally determined by most election strategies. The experimental results show that the proposed method can not only detect watermarks under different attack conditions, ensure the robustness of big data watermarks, but also achieve better data quality, and the comprehensive effect of data watermarks is better than the existing methods.

Full Text
Paper version not known

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 call