面向內(nèi)容認(rèn)證的關(guān)系數(shù)據(jù)庫水印技術(shù)研究

針對現(xiàn)有水印算法的不足，提出了一種新的脆弱性關(guān)系數(shù)據(jù)庫水印算法。在本算法中，
由水印密鑰控制元組的劃分和水印的生成，通過構(gòu)造水印矩陣對關(guān)系數(shù)據(jù)遭受的篡改進(jìn)行定位和描述。實驗結(jié)果和理論分析表明，水印生成方法安全有效，可實現(xiàn)水印的盲檢測。水印嵌入引起的數(shù)據(jù)誤差較小，算法具有較好的可行性。
關(guān)鍵詞: 數(shù)據(jù)庫水印;內(nèi)容認(rèn)證;分組;誤差
Abstract: A new fragile watermarking algorithm based on relational database is proposed in view of existing algorithm insufficiency. The tuples are divided into groups and the watermarks are constructed according to a embedding key in the algorithm. Watermarking matrix is constructed to detect and describe malicious modifications of relational data. Theoretical analysis show that the method of generating watermark is secure and effective, and may be used for blind extraction. Experimental results and theoretical analysis has proved the feasibility because of less permissible error of data caused by the embedding of watermarking.
Key words: database watermarking, content authenticity, group, permissible error