A Robust Reversible Watermarking Scheme for Relational Data

Reversible watermarking is widely used in copyright protection of relational data. It allows recovering the original data besides claiming copyright. In current schemes, watermarked data are either completely restored to the original version or kept unchanged. We present a robust and reversible watermark which allows arbitrary portion of the watermark to be removed. Experiments show the robust of the proposed algorithm is robust.