%0 Generic %1 Abhi03lowerbounds %A Abhi, Chris Peikert %A Bounds, Lower %A secure Fingerprinting, Collusion %A Peikert, Chris %A Smith, Adam %D 2003 %K code fingerprinting %T Lower Bounds for Collusion-Secure Fingerprinting %X 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.

@misc{Abhi03lowerbounds, abstract = {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.}, added-at = {2009-05-18T18:40:07.000+0200}, author = {Abhi, Chris Peikert and Bounds, Lower and secure Fingerprinting, Collusion and Peikert, Chris and Smith, Adam}, biburl = {https://www.bibsonomy.org/bibtex/245c18c7a76079c6a918c9165bc3ceefb/ywhuang}, description = {Lower Bounds for Collusion-Secure Fingerprinting}, interhash = {fb027e026e250beb96bfa135d5db0b39}, intrahash = {45c18c7a76079c6a918c9165bc3ceefb}, keywords = {code fingerprinting}, timestamp = {2009-05-18T18:40:07.000+0200}, title = {Lower Bounds for Collusion-Secure Fingerprinting}, year = 2003 }