Relational Database Watermarking for Data Tracing

Data should be distributed to clients from a centralized database. But distribution may result in a number of problems such as unauthorized copies and alteration of data. As an important branch of information hiding technology, digital watermarking technology is an effective method to realize the protection of copyright of relational database. However, the vast majority of relational digital watermarking solutions have the problem of limited use times of watermarks. In this paper, we propose a watermark scheme based on clustering, along with watermark embedding algorithm, watermark detection algorithm, and data recovery algorithm. By controlling the relevant parameters, we can verify the watermark for several times. We also elaborated how to use this scheme for database traceability. In the end of this paper, the calculation performance experiment of the algorithm shows that the scheme has good feasibility; the anti-attack ability comparison experiment shows that the scheme has good robustness.