Software watermarking: models and dynamic embeddings
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Query-preserving watermarking of relational databases and XML documents
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constructing a virtual primary key for fingerprinting relational data
Proceedings of the 3rd ACM workshop on Digital rights management
Watermarking relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Fingerprinting relational databases
Proceedings of the 2006 ACM symposium on Applied computing
Query-based watermarking for XML data
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
A fractal watermark solution for product data
CSCWD'06 Proceedings of the 10th international conference on Computer supported cooperative work in design III
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Solvability of a system of bivariate polynomial equations over a finite field
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Watermarking geographical data on spatial topological relations
Multimedia Tools and Applications
A new scheme to fingerprint XML data
KDXD'06 Proceedings of the First international conference on Knowledge Discovery from XML Documents
Hi-index | 0.00 |
Watermarking enables provable rights over content, which has been successfully applied in multimedia applications. However, it is not trivial to apply the known effective watermarking schemes to XML data, since noisy data may not be acceptable due to its structures and node extents. In this paper, we present two different watermarking schemes on XML data: the selective approach and the compression approach. The former allows us to embed non-destructive hidden information content over XML data. The latter takes verbosity and the need in updating XML data in real life into account. We conduct experiments on the efficiency and robustness of both approaches against different forms of attack, which shows that our proposed watermarking schemes are reasonably efficient and effective.