Title
An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths
Abstract
The code length of Tardos's collusion-secure fingerprinting code (STOC'03) is of theoretically minimal order with respect to the number of malicious users (pirates); however, the constant factor should be further reduced for practical implementation. In this paper we give a collusion-secure fingerprinting code by mixing recent two improvements of Tardos code and modifying their pirates tracing algorithms. Our code length is significantly shorter than Tardos code, especially in the case of fewer pirates. For example, the ratio of our length relative to Tardos code in some practical situation with 4 pirates is 4.33%; while the lowest among the preceding codes in this case (Skoric et al., 2007) is 9.87%.
Year
DOI
Venue
2007
10.1007/978-3-540-77224-8_12
AAECC
Keywords
Field
DocType
constant factor,short length,practical situation,code length,malicious user,practical implementation,theoretically minimal order,fewer pirate,preceding code,tardos code,collusion-secure fingerprinting code
Discrete mathematics,Tracing,Content server,Mathematics,Collusion
Conference
Volume
ISSN
ISBN
4851
0302-9743
3-540-77223-5
Citations 
PageRank 
References 
12
0.77
8
Authors
7
Name
Order
Citations
PageRank
Koji Nuida116623.53
Satoshi Fujitsu2663.75
Manabu Hagiwara324024.06
Takashi Kitagawa4976.54
Hajime Watanabe513311.95
Kazuto Ogawa612315.62
Hideki Imai761543.56