Improved versions of Tardos' fingerprinting scheme

DOI10.1007/s10623-008-9200-zzbMath1183.68262OpenAlexW2087879325MaRDI QIDQ1009029

Oded Blayer, Tamir Tassa

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-008-9200-z

zbMATH Keywords

codeword lengthTardos' probabilistic fingerprinting scheme

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items

Accusation probabilities in Tardos codes: beyond the Gaussian approximation ⋮ Optimal symmetric Tardos traitor tracing schemes ⋮ 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
• Tracing traitors
• Collusion-secure fingerprinting for digital data
• Optimal probabilistic fingerprint codes
• Dynamic traitor tracing