基于Asmuth-Bloom门限方案的动态图软件水印保护技术

动态图软件水印在抗攻击性方面较通常的静态水印有明显的优势,然而通过透彻的分析和修改嵌入水印后的程序,攻击者仍然可以找到水印结构并对其进行恶意破坏,从而使水印提取过程失败.为此,本文提出一种基于Asmuth-Bloom门限方案的软件水印分存算法,该算法将密码学中的密钥共享思想引入到软件水印中,实现了基于部分内容提取水印;最后通过鲁棒性对此算法进行了评测.该算法具有较强的鲁棒性,但该算法的不足之处是将水印数据扩张,减小了数据率和隐蔽性.     

基于特征子空间的数字水印技术

根据特五子空间的原理，提出了一种新颖的基于特征子空间的数字水印算法，水印可以嵌入到不同的子空间中从而可以发展为多水印算法，由于特征子空间之间的正交特性，不同子空间中的水印相互独立，其稳健性不随水印数目的增加而变化，水印强度参数根据视觉系统的照度掩蔽和纹理掩蔽特性适当地进行调整，从而同时保证二值水印图像的稳健性和不可见性，该文就单水印，双水印以及多水印情形进行了仿真并进行JPEG压缩，图像缩放，剪切等失真测试，实验结果表明该算法具有很好的感知质量和稳健性并验证了以上分析。     

基于混沌特性的小波数字水印技术及实现

本文讨论了利用混沌序列对图像信号加密和解密的方法,提出了基于混沌特性的小波数字水印技术,具体包括水印嵌入算法与实现步骤、水印提取原理与过程、算法参数分析等;设计了基于混沌特性的小波数字水印仿真系统并进行了相关实验.结果表明,本文提出的数字水印技术具有良好的隐藏性、稳定性和鲁棒性.水印检测时不需要原始载体和原始水印图像,是一种比较理想的变换域盲水印算法.     

基于变量防篡改的动态图软件水印方案

为了提高动态图软件水印的隐藏容量和鲁棒性,本文提出了一种基于变量防篡改的动态图软件水印方案。该方案利用不同进制形式的数可以相互转化的思想将大的水印信息分割成多个小的水印信息,然后将这些小的水印信息编码成一组图结构,动态地嵌入目标程序中。在编码水印信息时,利用动态图结构中结点的父指针来编码,并使其叶结点与目标程序变量关联,起到防篡改的作用,从而可对水印进行有效的保护。实验结果表明,嵌入水印信息后,目标程序的运行速度和结果都没有明显的变化,但水印对溢出攻击、扭曲攻击和附加攻击等都有明显的抵抗效果,水印也能够准确、方便地被提取出来。该方案的性能明显优于PPCT算法和常量防篡改水印算法。     

The optimized copyright protection system with genetic watermarking

Applications for robust watermarking is one of the major branches in digital rights management (DRM) systems and related researches. Based on existing experiences to evaluate the applicability of robust watermarking, it is generally agreed that three parameters or requirements, including the quality of watermarked contents, the survivability of extracted watermark after deliberate or unintentional attacks, and the number of bits embedded, need to be considered. However, performances relating to these three parameters conflict with each other, and the trade off must be searched for. In this paper, we take all the three requirements into consideration, and add the flexibility to meet the specific design in implementation. With the aid of genetic algorithm, we design an applicable system that would obtain the good quality, acceptable survivability, and reasonable capacity after watermarking. Simulation results present the effectiveness in practical implementation and possible application of the proposed algorithm.     

基于栈状态关系的动态软件水印算法

针对已有软件水印算法的不足,提出了一种基于栈状态关系的动态软件水印算法。算法通过控制程序运行过程中产生的栈状态转移关系隐藏软件水印,给出了栈状态转移图的概念,并对其满足的性质进行了阐述;给出了详细的嵌入和提取算法,并通过一个具体实例描述了软件水印嵌入过程。对该算法的安全性和效率的实验和分析表明,该算法有着良好的隐蔽性,并能有效抵抗多种攻击。     

基于Shamir秘密共享方案的数字水印算法

数字水印已成为数字作品版权保护的一种手段,而鲁棒性和不可察觉性是其基本要求.为此,提出了一种基于Shamir秘密共享方案的数字水印算法.该算法首先将图象分成n块,并将水印信息也分成n份,然后通过DCT的相邻系数比较法,将每份水印信息嵌入到图象的相应块中,提取时,只要获得其中的任意t(≤n)份水印信息就可以恢复出原始水印.为提高提取水印图象的精度,给出了基于模糊集的改进算法.实验结果表明,该算法的隐藏效果很好,并且对单一攻击及多种复合攻击具有很好的鲁棒性.     

一种基于混沌的软件水印算法框架及实现

针对现有软件水印算法中存在的一些不足,将反逆向工程技术和混沌系统与Easter Egg软件水印的思想相结合,提出了一个基于混沌的软件水印算法框架.该框架通过引入混沌系统,把水印信息散列编码到整个代码当中,以保护全部代码;通过引入反逆向工程技术来抵抗逆向工程攻击,算法框架与软硬件平台无关.在i386体系结构Windows平台下实现了该算法框架,并以该实现为例分析了水印的鲁棒性,讨论了水印的嵌入对程序性能的影响.分析表明,该算法可以有效地抵抗各种语义保持变换攻击,对逆向工程攻击具有较好的抵抗性,鲁棒性较高.     

基于DWT-SVD域的彩色图像自适应水印算法

为了保护数字彩色图像版权,提出了一种结合离散小波变换(DWT)和矩阵奇异值分解(SVD)的彩色图像自适应水印算法。其主要设计思想是:先将原RGB彩色图像的各颜色分量进行小波分解;再将得到的中、低频带的小波系数与原水印图像分别进行奇异值分解,水印信息的奇异值重复嵌入到三通道中、低频带的小波系数奇异值中,且利用临界视觉阈值与奇异值之间的关系对水印嵌入强度作自适应调节,从而达到增强水印鲁棒性和确保水印透明性的目的。本算法适用于二值及灰度水印,在二值水印的提取过程中需设定一个提取阈值,以保证提取水印的完整性。仿真结果说明本算法对水印系统的透明性与鲁棒性作了较好的协调,是一种较稳健的算法。     

A multimedia application for watermarking digital images based on a content based image retrieval technique

The current work is focused on the implementation of a robust multimedia application for watermarking digital images, which is based on an innovative spread spectrum analysis algorithm for watermark embedding and on a content-based image retrieval technique for watermark detection. The existing highly robust watermark algorithms are applying “detectable watermarks” for which a detection mechanism checks if the watermark exists or not (a Boolean decision) based on a watermarking key. The problem is that the detection of a watermark in a digital image library containing thousands of images means that the watermark detection algorithm is necessary to apply all the keys to the digital images. This application is non-efficient for very large image databases. On the other hand “readable” watermarks may prove weaker but easier to detect as only the detection mechanism is required. The proposed watermarking algorithm combine’s the advantages of both “detectable” and “readable” watermarks. The result is a fast and robust multimedia application which has the ability to cast readable multibit watermarks into digital images. The watermarking application is capable of hiding 2¹⁴ different keys into digital images and casting multiple zero-bit watermarks onto the same coefficient area while maintaining a sufficient level of robustness.     

基于小波系数比较的抗打印扫描数字水印算法

提出了一种在打印监控系统中应用的图像数字水印算法。将待打印的文档图像进行相同大小的分块,依据分块数量确定嵌入容量。对每一小块图像进行三级离散小波变换(DWT),通过调整子带中不同位置系数的大小关系在中频和高频分量中重复嵌入水印信息;依据择大判决原则从各子带提取的水印中确定最终水印,提取过程不需要原始图像,扫描分辨率在75dpi以上均可正确提取。实验表明,该算法能够有效抵抗几何攻击,对打印、复印和扫描具有鲁棒性,可实现对打印文件进行版权保护和来源鉴别。     

基于子块分割的自适应式全盲图像水印算法

为了提高水印的鲁棒性,文中提出了一种基于子块分割的自适应全盲水印算法ABWASS。在嵌入水印时,该算法根据宿主特征矩阵嵌入自适应调整后的水印图像,并使用改进的两阶段DWT方法在LH2子带中融入水印图像的关键信息,从而得到含双重水印的图像;提取水印时,首先分离水印分块方式等关键信息,并通过DCT变换获得特征矩阵,进而提取水印图像。由于该方法在获得含有水印的图像时,根据宿主图像对水印进行了微调,并嵌入了原始水印尺寸,因此在提取过程可以实现全盲。实验结果表明,较已有方法,所提算法能够很好地抵抗多数常规攻击和几何攻击,并且在抵抗混合攻击上其性能均得到了提高,最大提升了2.7%;同时,其还具备较好的水印隐蔽性和实用性。     

Watermarking relational data: framework,algorithms and analysis

We enunciate the need for watermarking database relations to deter data piracy, identify the characteristics of relational data that pose unique challenges for watermarking, and delineate desirable properties of a watermarking system for relational data. We then present an effective watermarking technique geared for relational data. This technique ensures that some bit positions of some of the attributes of some of the tuples contain specific values. The specific bit locations and values are algorithmically determined under the control of a secret key known only to the owner of the data. This bit pattern constitutes the watermark. Only if one has access to the secret key can the watermark be detected with high probability. Detecting the watermark requires access neither to the original data nor the watermark, and the watermark can be easily and efficiently maintained in the presence of insertions, updates, and deletions. Our analysis shows that the proposed technique is robust against various forms of malicious attacks as well as benign updates to the data. Using an implementation running on DB2, we also show that the algorithms perform well enough to be used in real-world applications.Received: 29 July 2002, Accepted: 10 December 2002, Published online: 10 July 2003Edited by P. BernsteinA preliminary version of this paper appeared in the Proceedings of the 28th VLDB Conference, Hong Kong, China, 2002.     

A multiple watermarking algorithm for vector geographic data based on coordinate mapping and domain subdivision

A lot of watermarking algorithms for vector geographic data are presented in the literature. Due to widely application of digital watermarking, more demands are required, such as multiple watermarking algorithm. However, vector geographic data attracted less research focus on multiple watermarking. Consequently, a multiple watermarking algorithm for vector geographic data is proposed. In particular, the vertices are mapped to the logic domains firstly based on the constructed function. Then every domain is subdivided into blocks according to dichotomy and the number of embedding watermarks. Then, every watermark is embedded in the corresponding block. During the watermark detection, the watermarks are detected without the original vector geographic data. Finally, the experiments are made to test the multiple watermark capacity and robustness against attacks, with an emphasis on cropping attacks. The experimental results show that the proposed algorithm has good robustness against common attacks, such as, data simplification, vertex addition, vertex deletion, feature deletion, and cropping attacks. Moreover, the algorithm provides high multiple watermark capacity.     

数字博物馆中的图像版权保护研究

随着数字博物馆的不断发展,关于数字博物馆中的图像版权保护越来越受到人们的重视。首先对数字水印技术和数字博物馆进行介绍,然后就数字水印技术用于解决数字博物馆中图像版权保护问题进行探讨,提出一种新的基于奇异值分解的盲数字图像水印算法。利用Arnold混沌映射将水印进行预处理,并按水印的大小把原始图像分成若干个子块,利用矩阵的奇异分解方法分解每个子块,通过比较调整相邻图像块最大奇异值来完成水印的嵌入。实验结果表明,该算法对于JPEG有损压缩、剪切、加噪声等攻击具有很强的鲁棒性。     

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

用水印实现数据库版权保护,是数据库安全领域新的研究热点,而提高水印算法的鲁棒性则是其中的一个研究重点.提出基于(t,n)门限的数据库水印算法,在水印图像嵌入时,利用门限算法对水印图像进行分存,得到水印影子,将这些影子与数据库数据混合并嵌入到数据库中,使得对数据库的恶意攻击不会直接破坏水印本身;在提取水印过程中,用若干水印影子的组合还原水印图像,减少了水印被破坏的程度.实验分析表明,该水印算法是有效的,并且具有很好的鲁棒性.     

一种带纠错功能的鲁棒数字图像水印算法

提出一种基于水印数据纠错置换的数字图像水印嵌入方案.通过对二值水印图像进行置换,引入纠错机制,并将其应用于传统的小波域算法中.实验结果表明,在相同的水印嵌入强度和攻击强度条件下,通过引入纠错机制,可以显著提高水印在抗JPEG压缩、抗剪切、抗缩放、抗中值滤波、抗噪声干扰等方面的鲁棒性.     

基于Blakley方案的音频水印分存算法

提出了一种基于Blakley密钥共享方案的音频水印分存算法。算法将密钥分存的思想引入到音频水印算法中,将水印分存到音频数据的不同段中,检测时只需提取出部分水印信息就可以恢复出原始水印。算法同时采用了Bark码来解决剪切攻击带来的同步问题,并利用逼近信号统计特征和纠错码技术来提高算法的鲁棒性。实验证明,算法具有较强的抗剪切攻击能力。     

Visible watermarking with reversibility of multimedia images for ownership declarations

Digital watermarking technology is primarily the joining of the rightful owner of the protected media. Once the media are suspected to be illegally used, an open algorithm can be used to extract the digital watermark for the purpose of showing the media’s ownership. From a hidden watermark in the media from the appearance point of view, general digital watermarking technologies can be divided into two categories: visible watermark technology and invisible watermark technology. Visual watermark technology embeds a watermark into the protected media to declare ownership and deter pirate behavior. In this paper, we propose a reversible visible watermark method, which embeds a binary-imaged watermark into gray-scale images to create a visible watermark. Not using complex calculations, this paper tries to simply change the pixel value to achieve the digital watermark, where our scheme is also against the possible detections with LSB-based manners in use. Furthermore, a reversible steganographic method is used to embed the watermarking information into the watermarking images. The watermark information can then be used to recover the original images.     

新式灰度图像盲检测数字水印算法

将冗余离散小波(RDWT)与矩阵Schur分解结合,提出了一种新式灰度图像盲检测数字水印算法。该算法将载体图像进行二级RDWT变换提取其逼近子图低频部分,并将分块后的每个块低频系数进行Schur分解,通过修改Schur分解后的上三角矩阵对角线上的最大能量元素完成对经Fibonacci变换加密后的水印图像的嵌入,水印的提取过程实现了盲提取。实验结果表明,该水印算法水印嵌入的时间仅为0.97s,平均提取水印时间为0.211s,与类似盲水印算法相比,不可见性的PSNR值提高了14.12%,抵抗高斯噪声攻击、椒盐噪声攻击和剪切几何攻击的能力也分别提高了21.32%、17.31%和27.83%。