基于(t,n)门限的关系型数据库水印算法  

RELATIONAL DATABASE WATERMARKING ALGORITHM BASED ON(t,n) THRESHOLD

作　　者：黄德才[1] 姚瑶[1] 刘端阳[1] 龚卫华[1] 

机构地区：[1]浙江工业大学信息工程学院,浙江杭州310014

出　　处：《计算机应用与软件》2009年第7期81-84,共4页Computer Applications and Software

基　　金：浙江省自然科学基金项目(Y107596)

摘　　要：用水印实现数据库版权保护,是数据库安全领域新的研究热点,而提高水印算法的鲁棒性则是其中的一个研究重点。提出基于(t,n)门限的数据库水印算法,在水印图像嵌入时,利用门限算法对水印图像进行分存,得到水印影子,将这些影子与数据库数据混合并嵌入到数据库中,使得对数据库的恶意攻击不会直接破坏水印本身;在提取水印过程中,用若干水印影子的组合还原水印图像,减少了水印被破坏的程度。实验分析表明,该水印算法是有效的,并且具有很好的鲁棒性。Using watermark to protect the copyright of database is a new research hotpoint on database security area, and how to improve the robustness of the watermarking algorithm has became one of the research focuses currently. A new watermarking algorithm to embed water- mark into database based on （t, n） threshold is presented in this paper. In order to resist various malignant attacks to watermark itseif, （t, n） threshold is used to divide watermark image into some shade shares during its embedding, which are the real ones used to be embedded into database blended with the data. While extracting the watermark,watermark image can be restored from the combination of these shade shares, so damages on watermark is reduced greatly. Finally, experiments show that the watermarking algorithm is efficient and robust.

关 键 词：门限 数据库 水印 图像 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] TP391.41[自动化与计算机技术—计算机科学与技术]