False positive probabilities in q-ary Tardos codes: comparison of attacks

DOI10.1007/S10623-014-9937-5zbMATH Open1361.94070OpenAlexW2125401986MaRDI QIDQ2345926FDOQ2345926

Authors: A. Simone, Boris Škorić 

Publication date: 21 May 2015

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

Full work available at URL: https://doi.org/10.1007/s10623-014-9937-5

Recommendations

• Binary and \(q\)-ary Tardos codes, revisited
• Accusation probabilities in Tardos codes: beyond the Gaussian approximation
• False negative probabilities in Tardos codes
• Tardos Fingerprinting is Better Than We Thought
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes

zbMATH Keywords

collusiontraitor tracingwatermarkingTardos code

Mathematics Subject Classification ID

Other types of codes (94B60)

Cites Work

• Series approximation methods in statistics.
• Sequential Monte Carlo for rare event estimation
• Collusion-secure fingerprinting for digital data
• 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
• Accusation probabilities in Tardos codes: beyond the Gaussian approximation
• Title not available (Why is that?)
• Binary and \(q\)-ary Tardos codes, revisited

Cited In (2)

• Accusation probabilities in Tardos codes: beyond the Gaussian approximation
• False negative probabilities in Tardos codes

This page was built for publication: False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks

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