Asymmetric fingerprinting for larger collusions
Proceedings of the 4th ACM conference on Computer and communications security
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
Key Preassigned Traceability Schemes for Broadcast Encryption
SAC '98 Proceedings of the Selected Areas in Cryptography
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Anonymous Traceability Schemes with Unconditional Security
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
| Hi-index | 0.00 |
To protect against illegal copying and distribution of digital objects, such as images, videos and software products, merchants can 'fingerprint' objects by embedding a distinct codeword in each copy of the object, hence allowing unique identification of the buyer. The buyer does not know where the codeword is embedded and so cannot tamper with it. However a group of dishonest buyers can compare their copies of the object, find some of the embedded bits and change them to create a pirate copy. A c-traceability scheme can identify at least one of the colluders if up to c colluders have generated a pirate copy. In this paper we assume the merchant is not trusted and may attempt to 'frame' a buyer by embedding the buyer's codeword in a second copy of the object. We introduce a third party called the 'arbiter' who is trusted and can arbitrate between the buyer and the merchant if a dispute occurs. We describe the system as a set system and give two constructions, one based on polynomials over finite fields and the other based on orthogonal arrays, that provide protection in the above scenario.