Collusion Secure q-ary Fingerprinting for Perceptual Content
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Optimal probabilistic fingerprint codes
Journal of the ACM (JACM)
Optimal Gaussian fingeprint decoders
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Modern Coding Theory
Regular simplex fingerprints and their optimality properties
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Anti-collusion fingerprinting for multimedia
IEEE Transactions on Signal Processing
Identification of traitors in algebraic-geometric traceability codes
IEEE Transactions on Signal Processing - Part II
Collusion-Resistant Video Fingerprinting for Large User Group
IEEE Transactions on Information Forensics and Security
Joint coding and embedding techniques for MultimediaFingerprinting
IEEE Transactions on Information Forensics and Security
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Digital fingerprinting codes: problem statements, constructions, identification of traitors
IEEE Transactions on Information Theory
Applications of list decoding to tracing traitors
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The rate of a fingerprinting code is defined as R= (1/N) log2M, where N is the code length and M the number of users. Capacity is the supremum of achievable rates for a given class of collusion attacks. Most fingerprinting codes in current literature are algebraic constructions with high minimum distance. These codes have low rate (relative to capacity) and thus long fingerprints for a given number of users and colluders. However, short fingerprints are valuable in media fingerprinting due to the limited number of robust features available for embedding. This paper proposes a framework to build high-rate fingerprinting codes operating near the fundamental capacity limit by concatenating short, random, and statistically independent subcodes. A practical implementation based on the turbo code construction is presented. Each subcode is decoded by a list Viterbi decoding algorithm, which outputs a list of suspect users. These lists are then processed using a matched filter, which extracts the most suspect user and declares him or her guilty. We provide examples of codes that are short, accommodate millions of users, and withstand (with an error probability of the order of 1%) dozens of colluders against the averaging or interleaving attack followed by additive white Gaussian noise. Our fingerprinting codes operate reliably at rates within 30% to 50% of capacity, which are substantially higher than any other existing code. The decoding complexity is linear in N, or, equivalently, in log M.