The Watermarking Model for Relational Database Based on Watermarking Sharing

In this paper we propose a conceptual framework for relational database based on secret sharing technology. We offer a technique to break the main secret into multiple parts and hide them individually in a relational database. The Lagrange Interpolating Polynomial method is used to recover the shared secret. The (k, n) threshold scheme is used to decide the minimum number of parts required to recover the secret data completely. Through deep data analysis, experimental results show how the proposed scheme can offer robust mechanism to protect data loss especially for the tuples deleting.