A construction is presented to obtain 3-secure fingerprinting codes for copyright protection. Resistance against collusions of up to three buyers is achieved with a codeword length dramatically shorter than the one required by the general Boneh-Shaw construction. Thus the proposed fingerprints require much less embedding capacity. Due to their very clandestine nature, collusions tend to involve a small number of buyers, so that there is plenty of use for codes providing cost-effective protection against collusions of size up to 3.
CITATION STYLE
Sebé, F., & Domingo-Ferrer, J. (2002). Short 3-secure fingerprinting codes for copyright protection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2384, pp. 316–327). Springer Verlag. https://doi.org/10.1007/3-540-45450-0_25
Mendeley helps you to discover research relevant for your work.