A Blind Reversible Robust Watermarking Scheme for Relational Databases

Algorithm 1

Tuple selection.

Input: relational database 𝑅, embedding secret key 𝐾, and parameter 𝑔

Output: Selected tuples 𝑆

(1) foreach tuple 𝑞∈𝑅 do

(2) if 𝐹(𝑞.𝑃𝐾) mod 𝑔 equal 0, then

(3) insert tuple 𝑞 into 𝑆

(4) end foreach

(5) return 𝑆