False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
From MaRDI portal
Publication:2345926
DOI10.1007/s10623-014-9937-5zbMath1361.94070OpenAlexW2125401986MaRDI QIDQ2345926
Publication date: 21 May 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9937-5
Related Items (1)
Cites Work
- Unnamed Item
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- Binary and \(q\)-ary Tardos codes, revisited
- Sequential Monte Carlo for rare event estimation
- 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
- Collusion-secure fingerprinting for digital data
- Optimal probabilistic fingerprint codes
- Series approximation methods in statistics.
This page was built for publication: False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks