Combinatorial schemes for protecting digital content
Simon R. Blackburn⋆ · Cambridge University Press eBooks · 2003
When digital information is widely distributed in some fashion, the distributor would often like to trace the source of pirate copies of the information. The paper surveys some of the schemes that have been proposed to achieve this aim, especially emphasising the underlying combinatorics involved. In particular, codes with the identifiable parent property, frameproof codes, secure frameproof codes, traceability schemes and related concepts are surveyed. Introduction Nowadays a vast amount of data is distributed in digital fashion (music, film and software being three important examples). Purchasers of the data want easy access, and data providers want to make sure that their data is not pirated. This paper concentrates on one specialised problem in this huge research area, where combinatorial methods have been especially useful. A rough description of the problem is as follows. A traitor is a user who is allowed access to the data (because, for example, they have paid a subscription fee) but who passes on data to an unauthorised third party, a pirate . There could be several traitors, all with different versions of the data, and all giving the information they know to the pirate. The pirate then creates a new version of the data to share with other unauthorised users. How can the data provider identify a traitor, if the provider comes into possession of the pirate's new version?