Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
From MaRDI portal
Publication:1008972
DOI10.1007/S10623-007-9142-XzbMATH Open1178.94251OpenAlexW1977832049MaRDI QIDQ1008972FDOQ1008972
Authors: Boris Škorić, Stefan Katzenbeisser, Mehmet U. Celik 
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-007-9142-x
Recommendations
- An improvement of discrete Tardos fingerprinting codes
- Information Security Practice and Experience
- A Family of Asymptotically Good Binary Fingerprinting Codes
- Equal-Weight Fingerprinting Codes
- An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Collusion-secure fingerprinting for digital data
- Combinatorial properties of frameproof and traceability codes
- Tracing traitors
- On codes with the identifiable parent property
- Optimal probabilistic fingerprint codes
- Tardos Fingerprinting is Better Than We Thought
- Title not available (Why is that?)
Cited In (25)
- False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- Optimal symmetric Tardos traitor tracing schemes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved versions of Tardos' fingerprinting scheme
- An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
- Digital fingerprinting under and (somewhat) beyond the marking assumption. (Invited talk)
- Systematic treatment of collusion secure codes: security definitions and their relations
- Binary fingerprinting codes
- Achievable Error Exponents for the Private Fingerprinting Game
- Binary and \(q\)-ary Tardos codes, revisited
- False negative probabilities in Tardos codes
- Title not available (Why is that?)
- An improvement of discrete Tardos fingerprinting codes
- On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks
- Improvement of collusion secure convolutional fingerprinting information codes
- Tardos Fingerprinting is Better Than We Thought
- Information Security Practice and Experience
- Optimal probabilistic fingerprint codes
- On the Fingerprinting Capacity Under the Marking Assumption
This page was built for publication: Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008972)
