Theory of linear and integer programming
Theory of linear and integer programming
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Digital watermarking
Information Hiding Techniques for Steganography and Digital Watermarking
Information Hiding Techniques for Steganography and Digital Watermarking
Error- and Collusion-Secure Fingerprinting for Digital Data
IH '99 Proceedings of the Third International Workshop on Information Hiding
Query-preserving watermarking of relational databases and XML documents
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
SP '83 Proceedings of the 1983 IEEE Symposium on Security and Privacy
Rights protection for relational data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Constructing a virtual primary key for fingerprinting relational data
Proceedings of the 3rd ACM workshop on Digital rights management
Watermarking relational data: framework, algorithms and analysis
The VLDB Journal — The International Journal on Very Large Data Bases
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
A Novel Framework for Watermarking: The Data-Abstracted Approach
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Hi-index | 0.00 |
Relational databases watermarking aims at protecting the intellectual or industrial property of a dataset, by applying secret and slight alterations on it. When critical usability constraints of this dataset must be preserved, finding such alterations (watermarks) is a difficult computational task, which is not optimized by the current watermarking systems. This is a critical limitation when considering fingerprinting applications, where several distinct watermarked databases have to be obtained.An important property of the watermark is to be resilient to attacks that try to erase it. Among these attacks, one of the most severe is the collusion attack, that locates the watermark by comparing several distinct watermarked versions of a database. Such an attack has not been taken into account by the existing databases watermarking methods, when usability constraints have to be preserved.In this paper, we present an efficient algorithm for collusion-secure fingerprinting that preserves usability constraints. We identify a class of constraints, namely weight-independent constraints, that can be translated into an integer linear program. Solutions of this program are acceptable watermarks. This representation is computed once and for all and has the following advantages. First, we can rely on state-of-the-art optimizers to reduce the search space and quickly find a good watermark. Second, for a carefully chosen class of watermarks, producing every new watermark is immediate, compared with the complete recomputation needed by existing watermarking methods. Finally, our algorithm addresses the problem of collusion attacks, by making possible the use of collusion-secure codes while respecting usability constraints.The formalism of this article permits to handle both relational databases and XML documents. The effectiveness of our techniques has been established on our open platform Watermill, that integrates fingerprinting management capabilities to standard relational or XML-native databases systems.