Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. In “Advanced in Cryptology-CRYPTO’95, Lecture Notes in Computer Science,” volume 963, pages 453–465. Springer-Velag, Berlin, Heidelberg, New York, 1995
B. Chor, A. Fiat, and M Naor. Tracing traitors In “Advanced in Cryptology-CRYPTO’94, Lecture Notes in Computer Science,” volume 839, pages 257–270. Springer-Velag, Berlin, Heidelberg, New York, 1994
C. J. Collbourn and J. H. Dinitz Eds. CRC “Handbook of Combinatorial Designs”. CRC Press, 1996.
K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric schemes. In “Advanced in Cryptology-EUROCRYPT’98, Lecture Notes in Computer Science,” volume 1462, pages 502–517. Springer-Velag, Berlin, Heidelberg, New York, 1998
B. Pfitzmann and M. Schunter. Asymmetric fingerprinting. In “Advanced in Cryptology-EUROCRYPT’96, Lecture Notes in Computer Science,” volume 1070, pages 84–95. Springer-Velag, Berlin, Heidelberg, New York, 1996
B. Pfitzmann and M. Waidner. Asymmetric fingerprinting for large collusions. In “proceedings of 4th ACM conference on computer and communications security,” pages 151–160, 1997.
D. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and framproof codes. “SIAM Journal on Discrete Mathematics,” 11:41–53, 1998.
D. Stinson and R. Wei. Key preassigning traceability schemes for broadcast encryption. In “Proceedings of S AC’98, Lecture Notes in Computer Science,” volume 1556, pages 144–156. Springer-Velag, Berlin, Heidelberg, New York, 1999
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Safavi-Naini, R., Wang, Y. (2000). A Combinatorial Approach to Asymmetric Traitor Tracing. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_41
Download citation
DOI: https://doi.org/10.1007/3-540-44968-X_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67787-1
Online ISBN: 978-3-540-44968-3
eBook Packages: Springer Book Archive