Elements of information theory
Elements of information theory
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Group-oriented fingerprinting for multimedia forensics
EURASIP Journal on Applied Signal Processing
Universal Single Transition Time Asynchronous State Assignments
IEEE Transactions on Computers
Anti-collusion fingerprinting for multimedia
IEEE Transactions on Signal Processing
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
Random codes: minimum distances and error exponents
IEEE Transactions on Information Theory
Digital fingerprinting codes: problem statements, constructions, identification of traitors
IEEE Transactions on Information Theory
On decoding of low-density parity-check codes over the binary erasure channel
IEEE Transactions on Information Theory
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the Fingerprinting Capacity Under the Marking Assumption
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
This paper adopts an information-theoretic framework for the design of collusion-resistant coding/decoding schemes for digital fingerprinting. More specifically, the minimum distance decision rule is used to identify 1 out of t pirates. Achievable rates, under this detection rule, are characterized in two scenarios. First, we consider the averaging attack where a random coding argument is used to show that the rate 1/2 is achievable with t = 2 pirates. Our study is then extended to the general case of arbitrary t highlighting the underlying complexity-performance tradeoff. Overall, these results establish the significant performance gains offered by minimum distance decoding compared to other approaches based on orthogonal codes and correlation detectors which can support only a subexponential number of users (i.e., a zero rate). In the second scenario, we characterize the achievable rates, with minimum distance decoding, under any collusion attack that satisfies the marking assumption. For t = 2 pirates, we show that the rate 1 - H (0.25) ≅ 0.188 is achievable using an ensemble of random linear codes. For t ≥ 3, the existence of a nonresolvable collusion attack, with minimum distance decoding, for any nonzero rate is established. Inspired by our theoretical analysis, we then construct coding/decoding schemes for fingerprinting based on the celebrated belief-propagation framework. Using an explicit repeat-accumulate code, we obtain a vanishingly small probability of misidentification at rate 1/3 under averaging attack with t = 2. For collusion attacks, which satisfy the marking assumption, we use a more sophisticated accumulate repeat accumulate code to obtain a vanishingly small misidentification probability at rate 1/9 with t = 2. These results represent a marked improvement over the best available designs in the literature.