Fingerprinting relational databases: schemes and specialties

Abstract

In this paper, we present a technique for fingerprinting relational data by extending Agrawal et al.'s watermarking scheme. The primary new capability provided by our scheme is that, under reasonable assumptions, it can embed and detect arbitrary bit-string marks in relations. This capability, which is not provided by prior techniques, permits our scheme to be used as a fingerprinting scheme. We then present quantitative models of the robustness properties of our scheme. These models demonstrate that fingerprints embedded by our scheme are detectable and robust against a wide variety of attacks including collusion attacks.

Keywords

This publication has 12 references indexed in Scilit:

Proving ownership over categorical data
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2004
Print signatures for document authentication
Published by Association for Computing Machinery (ACM) ,2003
Watermarking relational data: framework, algorithms and analysis
The VLDB Journal, 2003
Query-preserving watermarking of relational databases and XML documents
Published by Association for Computing Machinery (ACM) ,2003
Electronic marking and identification techniques to discourage document copying
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Error- and Collusion-Secure Fingerprinting for Digital Data
Published by Springer Nature ,2000
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory, 1998
Resolving rightful ownerships with invisible watermarking techniques: limitations, attacks, and implications
IEEE Journal on Selected Areas in Communications, 1998
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing, 1997
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM, 1970