Lower bounds for collusion-secure fingerprinting
Chris Peikert, Abhi A. Shelat, Adam Smith · 2003
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes. Boneh and Shaw [3] define a model for these types of codes and present an explicit construction. Their code has length (c^3 log(1/e)) and attains securityagainst coalitions of size c with error e. They also present a lower bound of (c log(1/e)) of the length of any collusion-secure code. As an