The Boneh-Shaw fingerprinting scheme is better than we thought

Authors:
H. G. Schaathun
Affiliations:
Dept. of Comput., Surrey Univ., UK
Venue:
IEEE Transactions on Information Forensics and Security
Year:
2006

Citing 0
Cited 3

Secure Video Multicast Based on Desynchronized Fingerprint and Partial Encryption

IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
A family of asymptotically good binary fingerprinting codes

IEEE Transactions on Information Theory
Image desynchronization for secure collusion-resilient fingerprint in compression domain

PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing

Quantified Score

Hi-index	0.06

Visualization

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 point out some differences between our model and others in the literature.