A collusion attack optimization framework toward spread-spectrum fingerprinting (original) (raw)

Collusion resistant fingerprinting of digital audio

Proceedings of the 4th …, 2011

Digital fingerprinting is a technique for tracing the distribution of multimedia content, and protecting it from unauthorized manipulation. Unique identification information is embedded into each distributed copy of the signal. In a collusion attack, fingerprints are combined to remove or distort the fingerprints. Audio signals are good candidates for fingerprinting, because of the forgiving nature of the human auditory system to cross-talk between channels. We use principal components of the audio signal to construct an abstract vector space. The fingerprints are ordered rotations in that space. The rotations are determined by arrays with good correlation properties. These arrays are embedded in real audio, and are imperceptible, according to a panel of experts. These fingerprints are resistant to an averaging collusion attack by hundreds or thousands of colluders, and can withstand a worst case RandNeg attack by up to 30 colluders.

Fingerprinting Codes for Multimedia Data against Averaging Attack

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009

Code construction for digital fingerprinting, which is a copyright protection technique for multimedia, is considered. Digital fingerprinting should deter collusion attacks, where several fingerprinted copies of the same content are mixed to disturb their fingerprints. In this paper, we consider the averaging attack, which is known to be effective for multimedia fingerprinting with the spread spectrum technique. We propose new methods for constructing fingerprinting codes to increase the coding rate of conventional fingerprinting codes, while they guarantee to identify the same number of colluders. Due to the new fingerprinting codes, the system can deal with a larger number of users to supply digital contents.

A collusion-resistant fingerprinting system for restricted distribution of digital documents

PloS one, 2013

Digital fingerprinting is a technique that consists of inserting the ID of an authorized user in the digital content that he requests. This technique has been mainly used to trace back pirate copies of multimedia content such as images, audio, and video. This study proposes the use of state-of-the-art digital fingerprinting techniques in the context of restricted distribution of digital documents. In particular, the system proposed by Kuribayashi for multimedia content is investigated. Extensive simulations show the robustness of the proposed system against average collusion attack. Perceptual transparency of the fingerprinted documents is also studied. Moreover, by using an efficient Fast Fourier Transform core and standard computer machines it is shown that the proposed system is suitable for real-world scenarios.

A Novel Embedding Method For An Anti-Collusion Fingerprinting By Embedding Both A Code And An Orthogonal Fingerprint

2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings

In this paper, a fingerprint embedding method better-suited for the AND anti-collusion code (AND-ACC) is proposed. The proposed method embeds both a code and an orthogonal fingerprint using different basis vectors depending on the bit. Although the detection for the embedding method is complex, the performance of the fingerprinting system using proposed embedding method with the AND-ACC against average attack is improved compared with the AND-ACC fingerprinting scheme using code modulation embedding method. The system using the proposed embedding method is robust against the linear combination collusion attack (LCCA) whereas the system using the code modulation is not.

Security and robustness constraints for spread-spectrum Tardos fingerprinting

2010 IEEE International Workshop on Information Forensics and Security, 2010

This paper presents a practical analysis of the impact of robustness and security on Tardos' collusion-secure fingerprinting codes using spread-spectrum watermarking modulations. In this framework, we assume that the coalition has to face an embedding scheme of given security level and consequently has to suffer a probability of wrongly estimating their embedded symbols. We recall the Worst Case Attack associated to this probability, e.g. the optimal attack which minimises the mutual information between the sequence of a colluder and the pirated one. For a given achievable rate of the Tardos' fingerprinting model, we compare the Improved Spread-Spectrum embedding versus a new secure embedding (called ρ-Circular Watermarking) considering the AWGN channel. We show that secure embeddings are more immune to decoding errors than non-secure ones while keeping the same fingerprinting capacity.

Universal fingerprinting: Capacity and random-coding exponents

2008 IEEE International Symposium on Information Theory, 2008

This paper studies fingerprinting games in which the number of colluders and the collusion channel are unknown. The fingerprints are embedded into host sequences representing signals to be protected and provide the receiver with the capability to trace back pirated copies to the colluders. The colluders and the fingerprint embedder are subject to signal fidelity constraints. Our problem setup unifies the signal-distortion and Boneh-Shaw formulations of fingerprinting. The fundamental tradeoffs between fingerprint codelength, number of users, and fidelity constraints are then determined. Several bounds on fingerprinting capacity have been presented in recent literature. This paper derives exact capacity formulas and presents a new randomized fingerprinting scheme with the following properties: (1) the encoder and receiver do not need to know the coalition size and collusion channel; (2) a tunable parameter ∆ trades off false-positive and false-negative error exponents; (3) the receiver provides a reliability metric for its decision; and (4) the scheme is capacity-achieving when the false-positive exponent ∆ tends to zero and the coalition size is known to the encoder. A fundamental component of the new scheme is the use of a "time-sharing" randomized sequence. The decoder is a maximum penalized mutual information decoder, where the significance of each candidate coalition is assessed relative to a threshold, and the penalty is proportional to the coalition size. A much simpler threshold decoder that satisfies properties (1)-(3) above but not (4) is also given.

Collusion-Resistant Audio Fingerprinting System in the Modulated Complex Lapped Transform Domain

PLoS ONE, 2013

Collusion-resistant fingerprinting paradigm seems to be a practical solution to the piracy problem as it allows media owners to detect any unauthorized copy and trace it back to the dishonest users. Despite the billionaire losses in the music industry, most of the collusion-resistant fingerprinting systems are devoted to digital images and very few to audio signals. In this paper, state-of-the-art collusion-resistant fingerprinting ideas are extended to audio signals and the corresponding parameters and operation conditions are proposed. Moreover, in order to carry out fingerprint detection using just a fraction of the pirate audio clip, block-based embedding and its corresponding detector is proposed. Extensive simulations show the robustness of the proposed system against average collusion attack. Moreover, by using an efficient Fast Fourier Transform core and standard computer machines it is shown that the proposed system is suitable for real-world scenarios.

Collusion-secure fingerprinting for digital data

IEEE Transactions on Information Theory, 1998

This paper discusses methods for assigning codewords 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.

New Traceability Codes Against a Generalized Collusion Attack for Digital Fingerprinting

Lecture Notes in Computer Science

In this paper, we discuss collusion-secure traceability codes for digital fingerprinting which is a technique for copyright protection of digital contents. We first state a generalization of conventional collusion attacks where illicit users of a digital content collude to create an illegal digital content. Then we propose a collusion-secure traceability code which can detect at least one colluder against it. We show the rate and properties of the proposed traceability code.

Collusion Resilient Fingerprint Design by Alternating Projections

2007 IEEE International Conference on Image Processing, 2007

Digital fingerprinting techniques aim to embed unique identification information into digital content distributed to individual users in order to track unauthorized use of multimedia files. Fraudulent users may not only attempt to remove the embedded signatures but also may form coalitions in order to remove the embedded fingerprint and disable tracking. This makes the design of fingerprints challenging. An effective fingerprint should not only carry the assigned users information but also guard against the possibility of falsely implicating an innocent user. Furthermore, in possible collusion scenarios, the colluded copies should identify each of the colluders. The embedded fingerprints should be imperceptible to maintain the commercial value of the content and preferably the fingerprint-based identification should survive content preserving signal processing. In this paper we give a precise description of each of these requirements and give a solution framework to obtain a set of fingerprinted images meeting these requirements.