Optimal symmetric Tardos traitor tracing schemes

DOI10.1007/S10623-012-9718-YMaRDI QIDQ2439747zbMATH OpenOpenAlexFDO

Authors Thijs Laarhoven, Benne de Weger

Publication date 17 March 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1107.3441

zbMATH Keywords

watermarkingfingerprinting codestraitor tracing schemes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)

Abstract: For the Tardos traitor tracing scheme, we show that by combining the symbol-symmetric accusation function of Skoric et al. with the improved analysis of Blayer and Tassa we get further improvements. Our construction gives codes that are up to 4 times shorter than Blayer and Tassa's, and up to 2 times shorter than the codes from Skoric et al. Asymptotically, we achieve the theoretical optimal codelength for Tardos' distribution function and the symmetric score function. For large coalitions, our codelengths are asymptotically about 4.93% of Tardos' original codelengths, which also improves upon results from Nuida et al.

Recommendations

• Improved versions of Tardos' fingerprinting scheme
• Private asymmetric fingerprinting: a protocol with optimal traitor tracing using Tardos codes
• Tardos Fingerprinting is Better Than We Thought
• Efficient Traitor Tracing from Collusion Secure Codes
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes

Cites work

• scientific article; zbMATH DE number 7051201 (Why is no real title available?)
• An improvement of discrete Tardos fingerprinting codes
• Improved versions of Tardos' fingerprinting scheme
• Optimal probabilistic fingerprint codes
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
• Tardos Fingerprinting is Better Than We Thought

Cited in

(5)

• Analysis of two tracing traitor schemes via coding theory
• Binary and \(q\)-ary Tardos codes, revisited
• False negative probabilities in Tardos codes
• Efficient Traitor Tracing from Collusion Secure Codes
• Collusion resistant watermarkable PRFs from standard assumptions

This page was built for publication: Optimal symmetric Tardos traitor tracing schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439747)