Dynamic Traitor Tracing

  • Amos Fiat
  • Tamir Tassa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1666)


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


Convergence Time Watermark Scheme Dynamic Setting Control Word Broadcast Encryption 
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.


  1. 1.
    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).Google Scholar
  2. 2.
    B. Chor, A. Fiat, and M. Naor, Tracing Traitors, Proc. Crypto 94, Springer LNCS 839, 1994, pp. 257–270.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    A. Fiat and M. Naor, Broadcast Encryption, Proc. Crypto 93, Springer LNCS 773, 1993, pp. 480–491.Google Scholar
  6. 6.
    Paul Kocher, Cryptography Research,
  7. 7.
    M. Naor and B. Pinkas, Threshold Traitor Tracing, Proc. Crypto 98, Springer LNCS 1462, 1998, pp. 502–517.Google Scholar
  8. 8.
    B. Pfitzmann, Trials of Traced Traitors, Information Hiding, Springer LNCS 1174, 1996, pp. 49–64.Google Scholar
  9. 9.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    J. Schwenk, J. Ueberberg, Tracing Traitors using Finite Geometries, manuscript.Google Scholar

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