False negative probabilities in Tardos codes
From MaRDI portal
Publication:488258
DOI10.1007/S10623-013-9856-XzbMATH Open1351.94064OpenAlexW1974904025MaRDI QIDQ488258FDOQ488258
Authors: A. Simone, 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-9856-x
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Collusion-secure fingerprinting for digital data
- On codes with the identifiable parent property
- 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
- False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
- Optimal symmetric Tardos traitor tracing schemes
- Title not available (Why is that?)
- Dynamic Tardos Traitor Tracing Schemes
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)