Applications of list decoding to tracing traitors

Abstract

We apply results from algebraic coding theory to solve problems in cryptography, by using recent results on list decoding of error-correcting codes to efficiently find traitors who collude to create pirates. We produce schemes for which the TA (traceability) traitor tracing algorithm is very fast. We compare the TA and IPP (identifiable parent property) traitor tracing algorithms, and give evidence that when using an algebraic structure, the ability to trace traitors with the IPP algorithm implies the ability to trace with the TA algorithm. We also demonstrate that list decoding techniques can be used to find all possible pirate coalitions. Finally, we raise some related open questions about linear codes, and suggest uses for other decoding techniques in the presence of additional information about traitor behavior. Index Terms-Algebraic geometry code, identifiable parent property, list decoding, traceability code, traitor tracing, Reed-Solomon code.A. Silverberg is with the

Improving the Boneh-Franklin Traitor Tracing Scheme

“…In practice, it takes us just a few minutes on a common desktop PC to trace large coalitions in systems having hundreds of millions of users. Our result improves the results obtained by Silverberg et al [37,38]. Our finding also applies to schemes using the same watermarking technique, such as the ones described in [23,15,16].…”

“…The overall complexity of our tracing procedures isÕ(k 2 ) which is independent of . The latter is not the case for the schemes based on algebraic codes described by Silverberg et al in [37,38].…”

“…Recently, Boneh et al [7] have presented a fully-collusion resistant traitor tracing scheme which has private keys of constant size and ciphertexts of size O( √ ). Finally, the low efficiency of tracing procedures in traitor tracing schemes has been addressed by Silverberg et al in [37,38]. The authors present several schemes based on algebraic codes which enable traitors to be traced in time polynomial in k 2 log .…”

Polynomial-Time Codes Against Averaging Attack for Multimedia Fingerprinting

“…In the context of multimedia fingerprinting, well-known collusion attacks are the interleaving attack (Boneh & Shaw, 1998;Fernandez & Soriano, 2004;Silverberg et al, 2003;Staddon et al, 2001) and the averaging attack (Trappe et al, 2003;Wu et al, 2004). The averaging attack is particularly effective when fingerprint's watermark is embedded into host multimedia via the spread spectrum technique.…”

“…In (Silverberg et al, 2003) and (Fernandez & Soriano, 2004), the list decoding of fingerprinting codes is used. This work assures that at least one of the colluders is identified with polynomial time complexity in the code length.…”