Journal of Computations & Modelling

Analysis total and better the Boneh–Shaw Fingerprinting codes

• [ Download ]
• Times downloaded: 10528

• Abstract

  Digital fingerprinting is a forensic method against illegal copying. The distributor marks each individual copy with a unique fingerprint. If an illegal copy appears, it can be traced back to one or more guilty pirates due to this fingerprint. To work against a coalition of several pirates, the fingerprinting scheme must be based on a collusion– secure code. This paper addresses binary collusion–secure codes in the setting of Boneh and Shaw (1995/1998). We prove that the Boneh-Shaw scheme is more efficient than originally proven, and we propose adaptations to further improve the scheme. We also show how to use these codes to construct binary fingerprinting codes with length L = o (C⁶ log c logn ).