Fingerprinting Relational Databases: Schemes and Specialities
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.
Fingerprint, collusion attack, relational database, robustness
Information Security and Trust
IEEE Transactions on Dependable and Secure Computing
LI, Yingjiu; Swarup, Vipin; and Jajodia, Sushil.
Fingerprinting Relational Databases: Schemes and Specialities. (2005). IEEE Transactions on Dependable and Secure Computing. 2, (1), 34-45. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1071