TY - GEN
T1 - Dynamic traitor tracing
AU - Fiat, Amos
AU - Tassa, Tamir
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.
PY - 1999/1/1
Y1 - 1999/1/1
N2 - 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"”.
AB - 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"”.
UR - http://www.scopus.com/inward/record.url?scp=84957076207&partnerID=8YFLogxK
U2 - 10.1007/3-540-48405-1_23
DO - 10.1007/3-540-48405-1_23
M3 - Conference contribution
AN - SCOPUS:84957076207
SN - 3540663479
SN - 9783540663478
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 354
EP - 371
BT - Advances in Cryptology – CRYPTO 1999 - 19th Annual International Cryptology Conference, Proceedings
A2 - Wiener, Michael
PB - Springer Verlag
T2 - 19th Annual International Cryptology Conference, CRYPTO 1999
Y2 - 15 August 1999 through 19 August 1999
ER -