检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:庄晓丹 骆希 何乐天 和旭东 Zhuang Xiaodan;Luo Xi;He Letian;He Xudong(Zhejiang Power Exchange Center Co.,Ltd.,Hangzhou 310037,Zhejiang,China;Beijing Key Laboratory of Security and Privacy in Intelligent Transportation,Beijing Jiaotong University,Beijing 100044,China)
机构地区:[1]浙江电力交易中心有限公司,浙江杭州310037 [2]北京交通大学智能交通数据安全与隐私保护技术北京市重点实验室,北京100044
出 处:《计算机应用与软件》2025年第3期291-297,共7页Computer Applications and Software
基 金:国网浙江省电力有限公司科技项目(2021FD01)。
摘 要:为了解决数据库水印算法中冗余空间少、修改数据影响数据库可用性和真实性等问题。该文提出一种基于生成网络和凸包的大容量数据库水印算法。该算法用LSTM和评价函数生成伪元组,用凸包算法区别真伪元组。通过向水印信息中插入标志位,能够将水印中的错误定位在两个标志位之间,缩小攻击对水印提取的影响。实验效果表明,该算法不可见性好,抵抗数据修改、删除、增加等数据库水印攻击的能力优于可逆水印算法。In order to solve the problem of less redundant space in database watermarking algorithm,and the databases'availability and authenticity affected by the modification of data,a large-capacity database watermarking algorithm based on generative networks and convex packages is proposed.The algorithm used LSTM and evaluation functions to generate pseudo-tuples,and the convex-pack algorithm to distinguish between real and pseudo-tuples.By inserting flag bits into the watermark information,the error in the watermark could be positioned between two flag bits,which reduced the impact of the attack on the watermark extraction.Experimental results show that the algorithm has good invisibility,and the ability to resist database watermark attacks such as data modification,deletion and addition,which is better than that of reversible watermarking algorithms.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7