数字指纹的技术分析与模型改进

数字指纹作为数字作品版权保护的一种新型技术,越来越受到人们的重视。文章首先介绍了数字指纹的功能与特征,然后分析了指纹的多种编码方案以及指纹协议的演进过程,最后提出了一种数字指纹的系统模型,该模型可用于一些数字作品的版权保护。     

Collusion-resistant fingerprinting for multimedia

Digital fingerprinting is a technology for enforcing digital rights policies whereby unique labels, known as digital fingerprints, are inserted into content prior to distribution. For multimedia content, fingerprints can be embedded using conventional watermarking techniques that are typically concerned with robustness against a variety of attacks mounted by an individual. These attacks, known as multiuser collusion attacks, provide a cost-effective method for attenuating each of the colluder's fingerprints and poses a real threat to protecting media data and enforcing usage policies. In this article, we review some major design methodologies for collusion-resistant fingerprinting of multimedia and highlight common and unique issues of different fingerprinting techniques. It also provides detailed discussions on the two major classes of fingerprinting strategies, namely, orthogonal fingerprinting and correlated fingerprinting.     

数字作品版权保护中的数字指纹编码

随着数字技术迅速发展,数字指纹技术也在不断地更新,针对数字指纹编码技术,文章研究了对数字指纹的攻击方式,分析了数字指纹编码的主要算法,并在介绍数字指纹编码发展状况的基础上探讨了数字指纹可能的研究方向。     

数字指纹技术的研究进展

数字指纹技术可以追踪盗版拷贝的来源,在版权保护等方面具有重要的作用,因此受到了越来越广泛的关注。本文介绍了数字指纹技术的基本原理,着重介绍了该领域的最新研究成果,比较了各种方案的性能,探讨了数字指纹技术未来的发展方向。     

基于数字权限管理的指纹视频技术研究

在部分加密的基础上,说明了数字指纹嵌入和视频加扰编码算法结合的应用算法.提出了一种新的指纹嵌入和解密集成的一体化技术方案结构.     

Collusion-secure fingerprinting for digital data

This paper discusses methods for assigning code-words for the purpose of fingerprinting digital data, e.g., software, documents, music, and video. Fingerprinting consists of uniquely marking and registering each copy of the data. This marking allows a distributor to detect any unauthorized copy and trace it back to the user. This threat of detection will deter users from releasing unauthorized copies. A problem arises when users collude: for digital data, two different fingerprinted objects can be compared and the differences between them detected. Hence, a set of users can collude to detect the location of the fingerprint. They can then alter the fingerprint to mask their identities. We present a general fingerprinting solution which is secure in the context of collusion. In addition, we discuss methods for distributing fingerprinted data     

Anti-collusion forensics of multimedia fingerprinting using orthogonal modulation.

Digital fingerprinting is a method for protecting digital data in which fingerprints that are embedded in multimedia are capable of identifying unauthorized use of digital content. A powerful attack that can be employed to reduce this tracing capability is collusion, where several users combine their copies of the same content to attenuate/remove the original fingerprints. In this paper, we study the collusion resistance of a fingerprinting system employing Gaussian distributed fingerprints and orthogonal modulation. We introduce the maximum detector and the thresholding detector for colluder identification. We then analyze the collusion resistance of a system to the averaging collusion attack for the performance criteria represented by the probability of a false negative and the probability of a false positive. Lower and upper bounds for the maximum number of colluders K(max) are derived. We then show that the detectors are robust to different collusion attacks. We further study different sets of performance criteria, and our results indicate that attacks based on a few dozen independent copies can confound such a fingerprinting system. We also propose a likelihood-based approach to estimate the number of colluders. Finally, we demonstrate the performance for detecting colluders through experiments using real images.     

数字水印的应用及需求分析

给出了一个完整的数字图像水印通信系统模型，对其中各个功能模块进行了分析。从应用的角度给出了数字水印的分类方法，给出了包括数字版权保护，数字指纹在内的数字水印技术的几个典型应用，在这些应用环境下对水印算法的具体要求进行了详细的分析。研究具体的数字水印技术的应用及其环境，分析其对数字水印技术的要求，对设计相应的数字水印算法将具有一定指导作用。     

Forensic analysis of nonlinear collusion attacks for multimedia fingerprinting.

Digital fingerprinting is a technology for tracing the distribution of multimedia content and protecting them from unauthorized redistribution. Unique identification information is embedded into each distributed copy of multimedia signal and serves as a digital fingerprint. Collusion attack is a cost-effective attack against digital fingerprinting, where colluders combine several copies with the same content but different fingerprints to remove or attenuate the original fingerprints. In this paper, we investigate the average collusion attack and several basic nonlinear collusions on independent Gaussian fingerprints, and study their effectiveness and the impact on the perceptual quality. With unbounded Gaussian fingerprints, perceivable distortion may exist in the fingerprinted copies as well as the copies after the collusion attacks. In order to remove this perceptual distortion, we introduce bounded Gaussian-like fingerprints and study their performance under collusion attacks. We also study several commonly used detection statistics and analyze their performance under collusion attacks. We further propose a preprocessing technique of the extracted fingerprints specifically for collusion scenarios to improve the detection performance.     

IPTV中的组播版权保护技术研究

分析了在IPTV组播条件下版权保护面临的新问题、新情况,介绍了版权保护技术中的几种叛逆者追踪技术,以及利用数字指纹技术对IPTV内容进行保护的方法.     

Algorithm to decode 'identifiable parent property' codes

In a fingerprinting scheme, marks are embedded in a digital object to protect intellectual property. Dishonest users can collude, change some of the marks and create a new copy. In this case codes with the 'identifiable parent property' or IPP codes [4], provide means of traceability. Here, both a new decoding algorithm for IPP codes and an improvement of earlier algorithms are presented.     

A new fingerprinting scheme using social network analysis for majority attack

Digital fingerprinting is a technology to protect multimedia content from unauthorized redistribution. However, collusion attack is a cost-efficient attack for digital fingerprinting, where groups of dishonest users create a pirate copy using their copies for the purpose of attenuating or removing the fingerprints. In this paper, FCBSN, Fingerprinting Code Based on Social Networks, for coding the user’s fingerprints to resist majority attack, is proposed. The proposed scheme stems from the concept of coalition which always occurred in a social network. Different from all existing work, we explore the notion of the hierarchical community structure of social network and its intrinsic properties to assign fingerprints to users, drawing on the social relation according to the similar metric between two users. Theoretical analysis and experimental results show that the FCBSN detector outperforms the existing group detector for BS code and Tardos detector by large margins.     

基于EIGamal加密算法的非对称数字指纹体制

将EIGamal公开密钥方案的思想用于非对称数字指纹体制的构造,提出一种不使用一般的安全多方计算协议的非对称数字指纹体制,该方案不仅具有较好的实现效率,还增加了用户的安全性,降低了发行商的风险,而且还能确定性地跟踪叛逆者。     

Digital fingerprinting codes: problem statements, constructions, identification of traitors

We consider a general fingerprinting problem of digital data under which coalitions of users can alter or erase some bits in their copies in order to create an illegal copy. Each user is assigned a fingerprint which is a word in a fingerprinting code of size M (the total number of users) and length n. We present binary fingerprinting codes secure against size-t coalitions which enable the distributor (decoder) to recover at least one of the users from the coalition with probability of error exp(-/spl Omega/(n)) for M=exp(/spl Omega/(n)). This is an improvement over the best known schemes that provide the error probability no better than exp(-/spl Omega/(n/sup 1/2/)) and for this probability support at most exp(O(n/sup 1/2/)) users. The construction complexity of codes is polynomial in n. We also present versions of these constructions that afford identification algorithms of complexity poly(n)=polylog(M), improving over the best previously known complexity of /spl Omega/(M). For the case t=2, we construct codes of exponential size with even stronger performance, namely, for which the distributor can either recover both users from the coalition with probability 1-exp(/spl Omega/(n)), or identify one traitor with probability 1.     

New paradigms for effective multicasting and fingerprinting of entertainment media

The large-scale adoption of network-centric entertainment systems rests on the ability to provide reliable, low-cost, and secure services for all parties in the entertainment distribution system. The use of modern data networks such as the Internet to communicate digital entertainment media is motivated, in part, by advancements in communication networking, signal processing, and storage technologies that facilitate more flexible and granular business models. This same technological progress can also be shown to equip potential "attackers" with the means to more easily violate system security. A broad class of system security issues for entertainment applications is addressed by the growing field of digital rights management. This article focuses on an aspect of DRM that involves multicast entertainment media distribution using digital encryption and digital fingerprinting technologies to prevent widespread piracy. The goal of DRM is to provide protection and facilitate equitable compensation for all parties in the entertainment distribution chain including content creators, aggregators, distributors, and consumers. Previous security proposals to protect entertainment media have sacrificed broadcast efficiency for security. This article collectively addresses security and broadcast efficiency for network-centric entertainment systems, an area of research seldom explored. We present the challenges, technological solutions, and future trends of this emerging field.     

一种无第三方参与的匿名指纹方案

基于类ElGamal加密体制,本文提出了一种无第三方参与的匿名数字指纹方案.在无第三方参与的情况下,该方案巧妙实现了销售商对匿名用户的身份认证,确保了只有合法注册用户才能得到数字产品;同时,销售商在收缴到盗版拷贝时,无须用户的参与就能够追踪出真正的盗版者.此外,方案还具备不可联系性,防诬陷性.方案的安全是基于解离散对数为困难问题.     

Anti-collusion fingerprinting for multimedia

Digital fingerprinting is a technique for identifying users who use multimedia content for unintended purposes, such as redistribution. These fingerprints are typically embedded into the content using watermarking techniques that are designed to be robust to a variety of attacks. A cost-effective attack against such digital fingerprints is collusion, where several differently marked copies of the same content are combined to disrupt the underlying fingerprints. We investigate the problem of designing fingerprints that can withstand collusion and allow for the identification of colluders. We begin by introducing the collusion problem for additive embedding. We then study the effect that averaging collusion has on orthogonal modulation. We introduce a tree-structured detection algorithm for identifying the fingerprints associated with K colluders that requires O(Klog(n/K)) correlations for a group of n users. We next develop a fingerprinting scheme based on code modulation that does not require as many basis signals as orthogonal modulation. We propose a new class of codes, called anti-collusion codes (ACCs), which have the property that the composition of any subset of K or fewer codevectors is unique. Using this property, we can therefore identify groups of K or fewer colluders. We present a construction of binary-valued ACC under the logical AND operation that uses the theory of combinatorial designs and is suitable for both the on-off keying and antipodal form of binary code modulation. In order to accommodate n users, our code construction requires only O(/spl radic/n) orthogonal signals for a given number of colluders. We introduce three different detection strategies that can be used with our ACC for identifying a suspect set of colluders. We demonstrate the performance of our ACC for fingerprinting multimedia and identifying colluders through experiments using Gaussian signals and real images.     

On the Fingerprinting Capacity Under the Marking Assumption

We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of the attacker coalition. Lower bounds are obtained by considering typical coalitions, which represents a new idea in the area of fingerprinting and enables us to improve the previously known lower bounds for coalitions of size two and three. For upper bounds, the fingerprinting problem is modeled as a communications problem. It is shown that the maximum code rate is bounded above by the capacity of a certain class of channels, which are similar to the multiple-access channel (MAC). Converse coding theorems proved in the paper provide new upper bounds on fingerprinting capacity. It is proved that capacity for fingerprinting against coalitions of size two and three over the binary alphabet satisfies and , respectively. For coalitions of an arbitrary fixed size , we derive an upper bound on fingerprinting capacity in the binary case. Finally, for general alphabets, we establish upper bounds on the fingerprinting capacity involving only single-letter mutual information quantities.     

基于改进小波包变换的音频指纹提取算法

数字音频指纹技术在音频信号分析和处理中起着重要作用。针对传统基于时频分析的音频指纹提取算法中仅使用信号能量作为特征参数,而无法全面表征出信号的复杂度和不规则性问题,提出了基于小波包分解与重构,将小波包系数的奇异值熵和样本熵相结合,作为音频信号的特征参数提取指纹。实验证明,该算法提取的指纹提高了音频识别的准确率,在常见信号处理下能保持较强的鲁棒性,并具有明显的区分音频和定位音频篡改位置的能力。     

A content security protection scheme in JPEG compressed domain

The access and distribution convenience of public networks opens a considerable content security threat when sending, receiving, and using multimedia information. In this paper, a content security protection scheme that integrates encryption and digital fingerprinting is proposed to provide comprehensive security protection for multimedia information during its transmission and usage. In contrast to other schemes, this method is implemented in the JPEG compressed domain with no transcoding or decompression, therefore, this scheme is highly efficient and suitable for multimedia information, which is seldom available in an uncompressed form. In addition, a variable modular encryption method is proposed to solve the invalid variable length coding (VLC) problem when a compressed data stream is encrypted directly. Experimental results demonstrate improved security and the efficiency provided by the proposed scheme. The experiments also demonstrate imperceptibility and collusion resistance of fingerprints.