An improvement of discrete Tardos fingerprinting codes

DOI10.1007/S10623-009-9285-ZzbMATH Open1174.94013OpenAlexW1968422945MaRDI QIDQ735039FDOQ735039

Authors: Koji Nuida, Satoshi Fujitsu, Manabu Hagiwara, Takashi Kitagawa, Hajime Watanabe, Kazuto Ogawa, Hideki Imai 

Publication date: 14 October 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-009-9285-z

Recommendations

• An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
• Tardos Fingerprinting is Better Than We Thought
• Improved versions of Tardos' fingerprinting scheme
• Binary and \(q\)-ary Tardos codes, revisited
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes

Mathematics Subject Classification ID

Cryptography (94A60) Other types of codes (94B60)

Cites Work

• The Lebesgue-Stieltjes Integral
• Collusion-secure fingerprinting for digital data
• Optimal probabilistic fingerprint codes
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
• Improved versions of Tardos' fingerprinting scheme
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Cited In (9)

• Optimal symmetric Tardos traitor tracing schemes
• Improved identification schemes based on error-correcting codes
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
• Improved versions of Tardos' fingerprinting scheme
• An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
• Binary and \(q\)-ary Tardos codes, revisited
• Tardos Fingerprinting is Better Than We Thought
• A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure
• Collusion resistant watermarkable PRFs from standard assumptions

This page was built for publication: An improvement of discrete Tardos fingerprinting codes

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