Efficient Traitor Tracing based on Collusion Secure Codes
Abstract: In this paper, we describe a new traitor tracing scheme which relies on Tardos' collusion secure codes to achieve for the first time constant size ciphertext. Our scheme is also equipped with a black-box tracing procedure against pirates that are allowed to decrypt with some (possibly high) error rate while keeping the decoders of the lowest possible size when using collusion secure codes, namely of size proportional to the length of Tardos' code: decoders have size O(t2 log N) and the corresponding tracing procedure has a time complexity of O(Nt2 log N).
- Get our paper published at ICITS 2008.
- Get the slides presented by Hieu at ENS on January 2009.
- Dan Boneh and Moni Naor updated their manuscript from Feb. 2008 on the same topic, check it there. Their construction (for imperfect decoders, the only realistic setting when using collusion secure codes) requires decoders of size O(N3 log N) and a tracing procedure with a time complexity of O(N3 log N).