Cryptology ePrint Archive: Report 2014/166

Tuple decoders for traitor tracing schemes

Jan-Jaap Oosterwijk, Jeroen Doumen, Thijs Laarhoven

Abstract: In the field of collusion-resistant traitor tracing, Oosterwijk et al. recently determined the optimal suspicion function for simple decoders. Earlier, Moulin also considered another type of decoder: the generic joint decoder that compares all possible coalitions, and showed that usually the generic joint decoder outperforms the simple decoder. Both Amiri and Tardos, and Meerwald and Furon described constructions that assign suspicion levels to $c$-tuples, where $c$ is the number of colluders. We investigate a novel idea: the tuple decoder, assigning a suspicion level to tuples of a fixed size. In contrast to earlier work, we use this in a novel accusation algorithm to decide for each distinct user whether or not to accuse him. We expect such a scheme to outperform simple decoders while not being as computationally intensive as the generic joint decoder. In this paper we generalize the optimal suspicion functions to tuples, and describe a family of accusation algorithms in this setting that accuses individual users using this tuple-based information.

Category / Keywords: Collusion resistance, traitor tracing

Original Publication (in the same form): Proc. SPIE 9028, Media Watermarking, Security, and Forensics 2014, 90280C
DOI:
10.1117/12.2037659

Date: received 3 Mar 2014

Contact author: J Oosterwijk at tue nl

Available format(s): PDF | BibTeX Citation

Version: 20140303:223607 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]