Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Hou, R., Xian, H., Wang, X., & Li, J. (2019). A Robust Reversible Watermarking Scheme for Relational Data. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 284, pp. 545–550). Springer Verlag. https://doi.org/10.1007/978-3-030-21373-2_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
