Binary and q-ary Tardos codes, revisited

DOI10.1007/S10623-013-9842-3zbMATH Open1351.94065OpenAlexW2025381528MaRDI QIDQ488254FDOQ488254

Jan-Jaap Oosterwijk, Boris Škorić

Publication date: 23 January 2015

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

Full work available at URL: https://doi.org/10.1007/s10623-013-9842-3

zbMATH Keywords

collusiontraitor tracingTardos fingerprinting

Mathematics Subject Classification ID

Cryptography (94A60) Other types of codes (94B60)

Cites Work

• Probability Inequalities for the Sum of Independent Random Variables
• Collusion-secure fingerprinting for digital data
• Optimal probabilistic fingerprint codes
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
• Improved versions of Tardos' fingerprinting scheme
• Tardos Fingerprinting is Better Than We Thought
• Accusation probabilities in Tardos codes: beyond the Gaussian approximation
• Optimal symmetric Tardos traitor tracing schemes
• Title not available (Why is that?)
• Partition Asymptotics from Recursion Equations
• An improvement of discrete Tardos fingerprinting codes

Cited In (3)

• False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
• The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes
• Efficient \(q\)-ary immutable codes

This page was built for publication: Binary and \(q\)-ary Tardos codes, revisited

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