Accusation probabilities in Tardos codes: beyond the Gaussian approximation

DOI10.1007/S10623-011-9563-4zbMath1259.94085OpenAlexW2112775739MaRDI QIDQ411486

Antonino Simone, Boris Škorić

Publication date: 4 April 2012

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

Full work available at URL: https://doi.org/10.1007/s10623-011-9563-4

zbMATH Keywords

power series expansionstraitor tracingGaussian approximationcollusion resistancefalse accusation probabilityTardos fingerprinting codes

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Signal detection and filtering (aspects of stochastic processes) (60G35) Other types of codes (94B60)

Related Items (3)

Binary and \(q\)-ary Tardos codes, revisited ⋮ False negative probabilities in Tardos codes ⋮ False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks

Cites Work

• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
• Improved versions of Tardos' fingerprinting scheme
• On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks
• Tardos Fingerprinting is Better Than We Thought
• Collusion-secure fingerprinting for digital data
• Optimal probabilistic fingerprint codes
• Unnamed Item
• Unnamed Item

This page was built for publication: Accusation probabilities in Tardos codes: beyond the Gaussian approximation