Abstract
Traitor tracing schemes were introduced so as to combat the typical piracy scenario whereby pirate decoders (or access control smart-cards) are manufactured and sold by pirates to illegal subscribers. Those traitor tracing schemes, however, are ineffective for the currently less common scenario where a pirate publishes the periodical access control keys on the Internet or, alternatively, simply rebroadcasts the content via an independent pirate network. This new piracy scenario may become especially attractive (to pirates) in the context of broadband multicast over the Internet. In this paper we consider the consequences of this type of piracy and offer countermeasures. We introduce the concept of dynamic traitor tracing which is a practical and efficient tool to combat this type of piracy. We also consider the static watermarking problem, presented by Boneh and Shaw, and derive bounds on the performance parameters of the “natural majority algorithm”.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Boneh and J. Shaw, Collusion-Secure Fingerprinting for Digital Data, IEEE Transactions on Information Theory, Vol. 44, 5, 1998, pp. 1897–1905 (see also Proc. Crypto 95, Springer LNCS 963, 1995, pp. 452–465).
B. Chor, A. Fiat, and M. Naor, Tracing Traitors, Proc. Crypto 94, Springer LNCS 839, 1994, pp. 257–270.
I.J. Cox, J. Kilian, T. Leighton and T. Shamoon, A Secure, Robust Watermark for Multimedia, Information Hiding, Springer LNCS 174, 1996, pp. 185–226.
C. Dwork, J. Lotspiech and M. Naor, Digital signets: Self-Enforcing Protection of Digital Information, 28th Symposium on the Theory of Computation, 1996, pp. 489–498.
A. Fiat and M. Naor, Broadcast Encryption, Proc. Crypto 93, Springer LNCS 773, 1993, pp. 480–491.
Paul Kocher, Cryptography Research, http://www.cryptography.com/dpa/index.html
M. Naor and B. Pinkas, Threshold Traitor Tracing, Proc. Crypto 98, Springer LNCS 1462, 1998, pp. 502–517.
B. Pfitzmann, Trials of Traced Traitors, Information Hiding, Springer LNCS 1174, 1996, pp. 49–64.
D. R. Stinson and R. Wei, Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes, SIAM Journal on Discrete Mathematics Vol. 11, 1, 1998, pp. 41–53.
J. Schwenk, J. Ueberberg, Tracing Traitors using Finite Geometries, manuscript.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fiat, A., Tassa, T. (1999). Dynamic Traitor Tracing. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_23
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive