High-Rate Random-Like Spherical Fingerprinting Codes With Linear Decoding Complexity

The rate of a fingerprinting code is defined as R = (1/N) log 2 M, 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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information forensics and security Jg. 4; H. 4; S. 768 - 780
Hauptverfasser: Jourdas, J.-F., Moulin, P.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.12.2009
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algebra
Algorithms
Capacity
Codes
coding
Complexity
Construction
Decoding
Fingerprint recognition
Fingerprinting
Fingerprints
Interleaved codes
Lists
Matched filters
Motion pictures
Protection
Robustness
Turbo codes
Viterbi algorithm
Watermarking
ISSN:1556-6013, 1556-6021
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The rate of a fingerprinting code is defined as R = (1/N) log 2 M, 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.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1556-6013
1556-6021
DOI:10.1109/TIFS.2009.2034188