The Boneh-Shaw fingerprinting scheme is better than we thought

Digital fingerprinting is a forensic method against illegal copying. The distributor marks each individual copy with a unique fingerprint. If an illegal copy appears, it can be traced back to one or more guilty pirates due to this fingerprint. To work against a coalition of several pirates, the fingerprinting scheme must be based on a collusion-secure code. This paper addresses binary collusion-secure codes in the setting of Boneh and Shaw (1995/1998). We prove that the Boneh-Shaw scheme is more efficient than originally proven, and we propose adaptations to further improve the scheme. We also point out some differences between our model and others in the literature.     

Watermill: An Optimized Fingerprinting System for Databases under Constraints

his paper presents a watermarking/fingerprinting system for relational databases. It features a built-in declarative language to specify usability constraints that watermarked datasets must comply with. For a subset of these constraints, namely weight-independent constraints, we propose a novel watermarking strategy which consists of translating them into an integer linear program. We show two watermarking strategies: an exhaustive one based on integer linear programming constraint solving and a scalable pairing heuristic. Fingerprinting applications, for which several distinct watermarks need to be computed, benefit from the reduced computation time of our method that precomputes the watermarks only once. Moreover we show that our method enables practical collusion-secure fingerprinting since the precomputed watermarks are based on binary alterations located at exactly the same positions. The paper includes an in-depth analysis of false hits and false misses occurrence probabilities for the detection algorithm. Experiments performed on our open source software Watermill assess the watermark robustness against common attacks, and show that our method outperforms the existing ones concerning the watermark embedding speed.     

Fingerprinting relational databases: schemes and specialties

In this paper, we present a technique for fingerprinting relational data by extending Agrawal et al.'s watermarking scheme. The primary new capability provided by our scheme is that, under reasonable assumptions, it can embed and detect arbitrary bit-string marks in relations. This capability, which is not provided by prior techniques, permits our scheme to be used as a fingerprinting scheme. We then present quantitative models of the robustness properties of our scheme. These models demonstrate that fingerprints embedded by our scheme are detectable and robust against a wide variety of attacks including collusion attacks.     

一种抗同步攻击的视频水印新方案

文章提出一种新颖的基于纠错和同步编码的视频水印方案,在嵌入水印时先将水印信息进行纠错编码后,和同步码作数据封装,然后嵌入到视频数据中。在检测水印时,先检测同步码,然后对得到的信息码进行纠错译码,还原出水印信息。此外,为了抵抗几何攻击,算法利用Zernike矩来确定水印嵌入的位置。实验表明,该水印方案具有低复杂性,能够有效抵抗帧丢失、帧插入等时间域的同步攻击与几何攻击。     

A robust watermarking scheme against frame blending and projection attacks

Camcorder based video copy attack has become a serious threat to the electronic movie distribution services. Although watermarking is used to authenticate against such camcorder based copy attack, in the camcorder recorded videos, the embedded watermark suffers from several geometric distortions and temporal de-synchronizations. This paper proposes a watermarking scheme which is robust against the distortion due to cam-cordering process. Firstly, a comprehensive literature survey has been done on the watermarking schemes resilient to the cam-cording attack. Based on the existing limitations of the state-of-art literature, a watermarking scheme is devised to embed a watermark which is robust against to frame blending and projection attacks which are the major distortions caused during cam-cording. A comprehensive set of experiments has been carried out to show the applicability of the proposed scheme over the existing literature.     

Mask-based fingerprinting scheme for digital video broadcasting

In this paper we propose a novel method to achieve video fingerprinting and confidentiality in a broadcasting environment. The fingerprinting technique can be used to generate unique copies for individual subscribers and can be used to identify the copyright violator. Thus for tracing the copyright violator, unique copy per subscriber is needed whereas broadcasting requires a single copy to be transmitted to everyone. The proposed method efficiently incorporates both these requirements. In addition to the fingerprinting requirement to trace the subscriber who is violating the copyright, a confidentiality requirement needs to be implemented against the non-subscribers in the broadcast region. The proposed algorithm efficiently combines both the fingerprinting requirement and confidentiality requirement into one single atomic process. The proposed algorithm uses robust invisible watermarking technique for fingerprinting and masking technique for confidentiality. The additional advantage of the proposed scheme is that it also supports MPEG-2 compressed domain processing, which is useful for many broadcasting standards.     

Real-time video watermarking techniques robust against re-encoding

This paper presents a real-time watermarking codec that is robust against re-encoding attacks for high-definition videos. The codec uses a segmentation function and texture detector techniques for applying real-time watermarking to human visual systems. Experimental results confirm that the proposed scheme satisfies the requirements of invisibility, real-time processing, and robustness against format conversion and low bit-rate encoding. The proposed algorithm has the advantages of simplicity, flexibility, and low computational burden; thus, it is a suitable candidate for many novel and interesting applications such as video fingerprinting for set-top boxes, Internet protocol television, personal video recorders, and satellite boxes.     

一种基于阿达马变换的数字水印加载技术在电子地图中的应用

该文针对“天地图·广东”（以下简称“天地图”）的电子地图瓦片,提出了一种基于阿达马变换的高适应性数字水印嵌入和导出算法。通过调整相应的控制参数,数字水印能以可见或不可见的形式嵌入到寄存在云端和公开发布的电子地图中。实验结果证明了面对图像攻击这种水印方法具有很高的健壮性,实现了跟踪、抵制“天地图”图片数据的非法流通,非法复制,有效的保护数据生产单位的合法权益。     

Contourlet-based image and video watermarking robust to geometric attacks and compressions

In this paper, we first propose a new blind image watermarking scheme robust to geometric attacks and compressions. The scheme is based on contourlet transform (CT) and principal component analysis (PCA). The scheme uses the principal components of the largest contourlet coefficients of the last directional subband of the cover image to embed the watermark. Meanwhile, with the noise visibility function (NVF), the watermarking strength is adjusted adaptively to preserve the perceptual quality of the image. The watermark can be detected with high accuracy after various possible distortions. The normalized correlation (NC) between the original watermark and the watermark extracted from the distorted watermarked image is used as the robustness evaluation criterion. The simulation results demonstrate that the proposed scheme has good performance in terms of both quality and robustness against a variety of image-processing attacks, such as rotation, scaling and image compressions. Then we extend the scheme to blind video watermarking. The performance of the video watermarking scheme is evaluated against video attacks like rotation, frame averaging, noise additions and video compressions. The introduction of the CT produces robustness against image and video compressions, and the PCA yields resistance to geometric attacks.

     

An interval centroid based spread spectrum watermarking scheme for multi-flow traceback

Network flow watermarking schemes have been proposed to trace network attacks in the presence of stepping stones or anonymized channels. Most existing interval-based watermarking schemes are not only ineffective in tracing multiple network flows in parallel due to severe inter-flow interference in practice but also vulnerable to the newly introduced watermarking attacks. By combining the Interval Centroid Based Watermarking (ICBW) modulation approach with the Spread Spectrum (SS) watermarking coding technique, we herein propose an Interval Centroid Based Spread Spectrum Watermarking scheme (ICBSSW) for efficiently tracing multiple network flows in parallel. Based on our proposed theoretical model, a statistical analysis of ICBSSW, with no assumptions or limitations concerning the distribution of packet times, proves its effectiveness and robustness against inter-flow interference. ICBSSW can thwart multi-flow attacks by utilizing multiple Pseudo-Noise (PN) codes as random seeds for randomizing the location of the embedded watermark across multiple flows. The experiments using a large number of synthetically generated secure shell (SSH) traffic flows demonstrate that ICBSSW can efficiently trace multiple flows simultaneously and achieve robustness against inter-flow interference. Furthermore, our approach can be applied to other interval-based flow watermarking schemes besides ICBW for effective and efficient multi-flow traceback.     

Chaos-based self-embedding fragile watermarking with flexible watermark payload

This paper proposes a self-embedding watermarking scheme that reduces the watermark payload significantly while maintaining good recovery quality and security. The embedded watermark contributes to the tamper detection and content recovery and is composed of only the compression codes of the image content. The compression codes with variable length are generated according to the roughness of the image. To improve the security, a chaos-based pseudorandom sequence generator is adopted to generate block-mapping sequence and encrypt compression codes. The proposed method takes into account the invisibility, recovery quality, and security using the flexible watermark payload, which preserves sufficient information of the image block with as few bits as possible. Experimental results demonstrate that the proposed scheme not only outperforms conventional self-embedding fragile watermarking algorithms in tamper detection and recovery, but also improve the security against the various counterfeiting attacks.     

.基于时间间隔的扩频流水印技术

将基于时间间隔的数据流调制方法和扩频通信原理相结合,提出基于时间间隔的扩频流水印技术,对于不同的待嵌水印位使用不同的正交伪噪声码进行扩展,通过调制包到达时间的统计特征将扩展水印信息嵌入到随机选择的时间间隔中。理论分析和实验结果表明,该技术可有效进行多流追踪,并能抵御多流和均方自相关攻击。     

一种双判决机制鲁棒数字水印

提出了一种基于双判决机制的数字水印算法。该算法利用分组移位算法进行水印置乱,并对水印信息循环编码,将载体图像进行分片以分散地嵌入多个完整水印拷贝,在水印提取阶段利用循环冗余译码判决和大数判决相结合的机制。实验结果证明,该算法具有较好的鲁棒性,能够抵抗常规图像处理。     

基于第二代Bandelet变换的抗几何攻击图像水印

抗几何攻击的鲁棒图像水印设计是目前水印技术研究的难点和热点之一. 文中分析了图像的Bandelet变换特性, 提出了一种以图像特征点矢量集为特征向量的回归支持向量机(Support vector regression, SVR)和第二代 Bandelet变换的抗几何攻击图像水印算法,采取的主要方法包括: 1)在Bandelet变换提取的刻画图像局部特征的几何流系数上, 采用奇偶量化嵌入水印; 2)利用Harris-Laplace算子从归一化的含水印图像中提取具有几何形变鲁棒性的图像特征点,构造特征点矢量集 作为特征向量,应用回归支持向量机对几何变换参数进行训练学习; 3)水印检测时, 先利用SVR训练模型得到待检测图像所受几何攻击的参数并作几何校正,然后通过奇偶检测器盲提取水印.仿真实验表明,所提出的水印算 法不仅具有良好的透明性,而且对常规图像处理、一般性几何攻击和组合攻击均具有良好的鲁棒性.     

Geometric distortion-resilient image hashing scheme and its applications on copy detection and authentication

Media hashing is an alternative approach to many applications previously accomplished with watermarking. The major disadvantage of the existing media hashing technologies is their limited resistance to geometric attacks. In this paper, a novel geometric distortion-invariant image hashing scheme, which can be employed to perform copy detection and content authentication of digital images, is proposed. Our major contributions are threefold: (i) a mesh-based robust hashing function is proposed; (ii) a sophisticated hash database for error-resilient and fast matching is constructed; and (iii) the application scalability of our scheme for content copy tracing and authentication is studied. In addition, we further investigate several media hashing issues, including robustness and discrimination, error analysis, and complexity, with respect to the proposed image hashing system. Exhaustive experimental results obtained from benchmark attacks confirm the excellent performance of the proposed method.     

A Multilevel Asymmetric Scheme for Digital Fingerprinting

The present paper proposes an asymmetric watermarking scheme suitable for fingerprinting and precision-critical applications. The method is based on linear algebra and is proved to be secure under projection attack. The problem of anonymous fingerprinting is also addressed, by allowing a client to get a watermarked image from a server without revealing her own identity. In particular, we consider the specific scenario where the client is a structured organization being trusted as a whole but involving possibly untrusted members. In such a context, where the watermarked copy can be made available to all members, but only authorized subgroups should be able to remove the watermark and recover a distortion-free image, a multilevel access to the embedding key is provided by applying Birkhoff polynomial interpolation. Extensive simulations demonstrate the robustness of the proposed method against standard image degradation operators.      

A new perceptual video fingerprinting system

Search, retrieval and storage of video content over the Internet and online repositories can be efficiently improved using compact summarizations of this content. Robust and perceptual fingerprinting codes, extracted from local video features, are astutely used for identification and authentication purposes. Unlike existing fingerprinting schemes, this paper proposes a robust and perceptual fingerprinting solution that serves both video content identification and authentication. While content identification is served by the robustness of the proposed fingerprinting codes to content alterations and geometric attacks, their sensitivity to malicious attacks makes them fit for forgery detection and authentication. This dual usage is facilitated by a new concept of sequence normalization based on the circular shift properties of the discrete cosine and sine transforms (DCT and DST). Sequences of local features are normalized by estimating the circular shift required to align each of these sequences to a reference sequence. The fingerprinting codes, consisting of normalizing shifts, are properly modeled using information-theoretic concepts. Security, robustness and sensitivity analysis of the proposed scheme is provided in terms of the security of the secret keys used during the proposed normalization stage. The computational efficiency of the proposed scheme makes it appropriate for large scale and online deployment. Finally, the robustness (identification-based) and sensitivity (authentication-based) of the proposed fingerprinting codes to content alterations and geometric attacks is evaluated over a large set of video sequences where they outperform existing DCT-based codes in terms of robustness, discriminability and sensitivity to moderate and large size intentional alterations.     

A multipurpose audio aggregation watermarking based on multistage vector quantization

Watermarking technology can achieve multipurpose such as copyright protection, copy protection, and integrity authentication. We propose a novel watermarking approach which involves robust watermark and fragile watermark in a two-stage quantization technique. Traditional watermarking algorithms mostly have poor performance in imperceptibility as the codeword selected from the modified codebook is not optimal. In our method, we select the codeword in the original codebook to ensure optimality. Furthermore, we use Huffman encoding to pick up property which is sensitive to many attacks in the entire aggregation. For copyright protection, the proposed scheme can resist attacks such as lossy compression, noise addition, and normalization. As for content authentication, the proposed scheme is sensitive to various attacks provided by Stirmark Benchmark for Audio. Experimental results show that the proposed method can be used respectively for protecting the copyright and authenticating the integrity of the audio aggregation.     

A robust watermarking scheme for 3D triangular mesh models

Copyright protection of digital media has become an important issue in the creation and distribution of digital content. As a solution to this problem, digital watermarking techniques have been developed for embedding specific information identifying the owner in the host data imperceptibly. Most watermarking methods developed to date mainly focused on digital media such as images, video, audio, and text. Relatively few watermarking methods have been presented for 3D graphical models. In this paper we propose a robust 3D graphical model watermarking scheme for triangle meshes. Our approach embeds watermark information by perturbing the distance between the vertices of the model to the center of the model. More importantly, to make our watermarking scheme robust against various forms of attack while preserving the visual quality of the models our approach distributes information corresponds to a bit of the watermark over the entire model, and the strength of the embedded watermark signal is adaptive with respect to the local geometry of the model. We also introduce a weighting scheme in the watermark extraction process that makes watermark detection more robust against attacks. Experiments show that this watermarking scheme is able to withstand common attacks on 3D models such as mesh simplification, addition of noise, model cropping as well as a combination of these attacks.     

基于公钥加密算法和PPCT动态图编码的软件指纹方案

提出了一种综合PPCT动态图编码方法和椭圆曲线加密算法的软件指纹方案,该方案将公钥加密技术和软件水印技术综合应用于软件版权的保护和验证过程中,充分利用两者的优势,具有安全性高和抗恶意篡改能力强的特点.