An introduction to signal detection and estimation (2nd ed.)
An introduction to signal detection and estimation (2nd ed.)
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Performance of orthogonal fingerprinting codes under worst-case noise
IEEE Transactions on Information Forensics and Security
Robust MC-CDMA-based fingerprinting against time-varying collusion attacks
IEEE Transactions on Information Forensics and Security
Regular simplex fingerprints and their optimality properties
IEEE Transactions on Information Forensics and Security
Saddle-point solution of the fingerprinting capacity game under the marking assumption
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Anti-collusion fingerprinting for multimedia
IEEE Transactions on Signal Processing
On the capacity game of private fingerprinting systems under collusion attacks
IEEE Transactions on Information Theory
On the Fingerprinting Capacity Under the Marking Assumption
IEEE Transactions on Information Theory
Forensic analysis of nonlinear collusion attacks for multimedia fingerprinting
IEEE Transactions on Image Processing
Anti-collusion forensics of multimedia fingerprinting using orthogonal modulation
IEEE Transactions on Image Processing
Hi-index | 0.01 |
We consider the digital fingerprinting (FP) problem and model it as a multiuser communications problem and develop a detection theoretic framework. In the general case, colluders apply uniform linear averaging followed by additive colored Gaussian noise. For each user, the receiver computes the correlation between the attacked signal and a linear-transformed version of that user's fingerprint, and performs thresholding (focused detection). Assuming independent colluders with potentially unequal priors, we derive generic exact bit-error probability (BEP) expressions, together with tight bounds, for arbitrary FP codes. Then, we specialize our results to orthogonal, simplex and Gaussian codes in the presence of additive white Gaussian noise; under mean squared error distortion constraints on the embedder and the colluders, we analytically quantify the optimal detection rule, the resulting minimum BEP and its asymptotic behavior, the collusion resistance, and the error exponent for the aforementioned codes, and compare their performances. We show that the minimum BEP expressions for these codes obey the same functional form and that they can be ordered as simplex, orthogonal, and Gaussian in terms of increasing BEP.