Back to Search Start Over

Binary and $$q$$ -ary Tardos codes, revisited.

Authors :
Škorić, Boris
Oosterwijk, Jan-Jaap
Source :
Designs, Codes & Cryptography; Jan2015, Vol. 74 Issue 1, p75-111, 37p
Publication Year :
2015

Abstract

The Tardos code is a much studied collusion-resistant fingerprinting code, with the special property that it has asymptotically optimal length $$m\propto c_0^2$$ , where $$c_0$$ is the number of colluders. In this paper we give alternative security proofs for the Tardos code, working with the assumption that the strongest coalition strategy is position-independent. We employ the Bernstein inequality and Bennett inequality instead of the typically used Markov inequality. This proof technique requires fewer steps and slightly improves the tightness of the bound on the false negative error probability. We present new results on code length optimization, for both small and asymptotically large coalition sizes. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
09251022
Volume :
74
Issue :
1
Database :
Complementary Index
Journal :
Designs, Codes & Cryptography
Publication Type :
Academic Journal
Accession number :
100320807
Full Text :
https://doi.org/10.1007/s10623-013-9842-3