Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes

DOI10.1007/S10623-007-9142-XzbMath1178.94251OpenAlexW1977832049MaRDI QIDQ1008972

Stefan Katzenbeisser, Mehmet U. Celik, Boris Škorić

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-007-9142-x

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (7)

Accusation probabilities in Tardos codes: beyond the Gaussian approximation ⋮ Optimal symmetric Tardos traitor tracing schemes ⋮ An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths ⋮ Binary and \(q\)-ary Tardos codes, revisited ⋮ False negative probabilities in Tardos codes ⋮ An improvement of discrete Tardos fingerprinting codes ⋮ False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On codes with the identifiable parent property
• Tardos Fingerprinting is Better Than We Thought
• Combinatorial properties of frameproof and traceability codes
• Tracing traitors
• Collusion-secure fingerprinting for digital data
• Optimal probabilistic fingerprint codes

This page was built for publication: Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes