An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths

DOI10.1007/978-3-540-77224-8_12zbMath1195.94096OpenAlexW1822242409MaRDI QIDQ5386080

Hajime Watanabe, Koji Nuida, Takashi Kitagawa, Satoshi Fujitsu, Kazuto Ogawa, Manabu Hagiwara, Hiroshi Imai

Publication date: 17 April 2008

Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77224-8_12

Mathematics Subject Classification ID

Other types of codes (94B60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

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

This page was built for publication: An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths