Publication Type

Journal Article

Version

acceptedVersion

Publication Date

3-2005

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

Fingerprint, collusion attack, relational database, robustness

Discipline

Information Security

Research Areas

Information Security and Trust

Publication

IEEE Transactions on Dependable and Secure Computing

Volume

2

Issue

1

First Page

34

Last Page

45

ISSN

1545-5971

Identifier

10.1109/TDSC.2005.12

Publisher

IEEE

Additional URL

https://doi.org/10.1109/TDSC.2005.12

Share

COinS