Recommendations
- False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
- Tardos Fingerprinting is Better Than We Thought
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- Binary and \(q\)-ary Tardos codes, revisited
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Cites work
- scientific article; zbMATH DE number 4016808 (Why is no real title available?)
- scientific article; zbMATH DE number 486467 (Why is no real title available?)
- scientific article; zbMATH DE number 7051201 (Why is no real title available?)
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- Collusion-secure fingerprinting for digital data
- Dynamic Tardos Traitor Tracing Schemes
- False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
- Improved versions of Tardos' fingerprinting scheme
- On codes with the identifiable parent property
- On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks
- Optimal probabilistic fingerprint codes
- Optimal symmetric Tardos traitor tracing schemes
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Tardos Fingerprinting is Better Than We Thought
This page was built for publication: False negative probabilities in Tardos codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488258)