Accusation probabilities in Tardos codes: beyond the Gaussian approximation

DOI10.1007/S10623-011-9563-4zbMATH Open1259.94085OpenAlexW2112775739MaRDI QIDQ411486FDOQ411486

A. 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

Recommendations

• Tardos Fingerprinting is Better Than We Thought
• False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
• Binary and \(q\)-ary Tardos codes, revisited
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
• Improved versions of Tardos' fingerprinting scheme

zbMATH Keywords

Gaussian approximationtraitor tracingcollusion resistancefalse accusation probabilitypower series expansionsTardos fingerprinting codes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Collusion-secure fingerprinting for digital data
• Title not available (Why is that?)
• Optimal probabilistic fingerprint codes
• 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

Cited In (4)

• False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
• Binary and \(q\)-ary Tardos codes, revisited
• False negative probabilities in Tardos codes
• Challenge codes for physically unclonable functions with Gaussian delays: a maximum entropy problem

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

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