Dynamic Traitor Tracing

  • Amos Fiat
  • Tamir Tassa
Conference paper

DOI: 10.1007/3-540-48405-1_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1666)
Cite this paper as:
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


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”.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Amos Fiat
    • 1
    • 2
  • Tamir Tassa
    • 2
  1. 1.Department of Computer Science, School of Mathematical SciencesTel Aviv UniversityTel AvivIsrael
  2. 2.Algorithmic Research Ltd.Petah TikvaIsrael

Personalised recommendations