Tardos Fingerprinting is Better Than We Thought
From MaRDI portal
Publication:3604793
DOI10.1109/TIT.2008.926307zbMATH Open1322.94101OpenAlexW2157531972MaRDI QIDQ3604793FDOQ3604793
Authors: Boris Škorić, T. U. Vladimirova, Joop Talstra, Mehmet U. Celik 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.926307
Recommendations
- Improved versions of Tardos' fingerprinting scheme
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
- An improvement of discrete Tardos fingerprinting codes
- Binary and \(q\)-ary Tardos codes, revisited
Cited In (16)
- 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
- Communication optimal Tardos-based asymmetric fingerprinting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Improved versions of Tardos' fingerprinting scheme
- Equal-Weight Fingerprinting Codes
- Title not available (Why is that?)
- Short \(c\)-secure fingerprinting codes
- Achievable Error Exponents for the Private Fingerprinting Game
- Binary and \(q\)-ary Tardos codes, revisited
- False negative probabilities in Tardos codes
- An improvement of discrete Tardos fingerprinting codes
- Improvement of collusion secure convolutional fingerprinting information codes
This page was built for publication: Tardos Fingerprinting is Better Than We Thought
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604793)
