An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation

Koji NUIDA  Satoshi FUJITSU  Manabu HAGIWARA  Hideki IMAI  Takashi KITAGAWA  Kazuto OGAWA  Hajime WATANABE  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E92-A   No.1   pp.197-206
Publication Date: 2009/01/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E92.A.197
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)
Category: Application
fingerprint,  c-secure code,  collusion attack,  security analysis,  watermark,  DRM,  

Full Text: PDF>>
Buy this Article

The code length of Tardos's collusion-secure fingerprint code is of theoretically minimal order with respect to the number of adversarial users (pirates). However, the constant factor should be further reduced for practical implementation. In this article, we improve the tracing algorithm of Tardos's code and propose a 2-secure and short random fingerprint code, which is secure against collusion attacks by two pirates. Our code length is significantly shorter than that of Tardos's code and its tracing error probability is practically small.