Improved Boneh-Shaw Content Fingerprinting
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Group-oriented fingerprinting for multimedia forensics
EURASIP Journal on Applied Signal Processing
Optimal probabilistic fingerprint codes
Journal of the ACM (JACM)
On the Design and Optimization of Tardos Probabilistic Fingerprinting Codes
Information Hiding
An improvement of discrete Tardos fingerprinting codes
Designs, Codes and Cryptography
EM decoding of tardos traitor tracing codes
Proceedings of the 11th ACM workshop on Multimedia and security
Estimating the Minimal Length of Tardos Code
Information Hiding
Regular simplex fingerprints and their optimality properties
IEEE Transactions on Information Forensics and Security
Linear universal decoding for compound channels
IEEE Transactions on Information Theory
Tardos's fingerprinting code over AWGN channel
IH'10 Proceedings of the 12th international conference on Information hiding
A new soft decision tracing algorithm for binary fingerprinting codes
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Improved spread spectrum: a new modulation technique for robust watermarking
IEEE Transactions on Signal Processing
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
Forensic analysis of nonlinear collusion attacks for multimedia fingerprinting
IEEE Transactions on Image Processing
Bias equalizer for binary probabilistic fingerprinting codes
IH'12 Proceedings of the 14th international conference on Information Hiding
| Hi-index | 0.00 |
When a binary fingerprinting codeword is embedded into digital contents using a spread-spectrum (SS) watermarking scheme, the marking assumption is not valid anymore because it is difficult for colluders to perform the symbol-wise attack for their codewords. As discussed in the SS-type fingerprinting schemes, veraging their copies is the cost-effective attack from the signal processing point of view. In this paper, we propose an optimal detector under the averaging attack and addition of white Gaussian noise. If the detector knows the number of colluders in advance, it first estimates the variance of additive noise, and then calculates the correlation scores using a log-likelihood-based approach. However, the number of colluders is not given in a real situation. We discover in this study that the characteristic of parameters for generating codewords enables us to eliminate the number of colluders as well as the estimation of the variance of noise at the calculation of correlation score, and propose a simplified detector by analyzing the scoring function in the optimal detector. We evaluate the performance of the simplified detector through simulation using not only codewords, but also a digital image.