An empirical study on the robustness of a fragile watermark for relational databases

Databases most often contain critical information. Unauthorized changes to databases can have serious consequences and may result in significant losses for the organization. This paper presents a viable solution for protecting the integrity of the data stored in relational databases using fragile watermarking. Prior techniques introduce distortions to the watermarked values and thus cannot be applied to all attributes. Our technique protects relational tables by reordering tuples relative to each other according to a secrete value (watermark). This paper introduces empirical study on the effect of data distribution and other data measures like the mean and standard deviation on the attack detection rates. A study on the cost, in terms of the execution time, of the proposed watermark insertion and data verification algorithms is also presented.